×

Found 417 Documents (Results 1–100)

Introduction to routing problems with mandatory transitions. (English) Zbl 07726608

Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 254-266 (2023).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for the directed path partition problems. (English) Zbl 1528.68280

Chen, Jing (ed.) et al., Frontiers of algorithmics. International joint conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12874, 23-36 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Brief announcement: non-blocking dynamic unbounded graphs with worst-case amortized bounds. (English) Zbl 07774303

Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 52, 4 p. (2021).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI

Upward point set embeddings of paths and trees. (English) Zbl 07405965

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges. (English. Russian original) Zbl 1469.05064

Probl. Inf. Transm. 57, No. 2, 161-177 (2021); translation from Probl. Peredachi Inf. 57, No. 2, 71-89 (2021).
MSC:  05C20 05C38 05C22
PDFBibTeX XMLCite
Full Text: DOI arXiv

Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section. (English. Russian original) Zbl 1466.90018

Autom. Remote Control 82, No. 5, 780-797 (2021); translation from Avtom. Telemekh. 2021, No. 5, 45-67 (2021).
PDFBibTeX XMLCite
Full Text: DOI

An efficient algorithm for 1-dimensional (Persistent) path homology. (English) Zbl 07760165

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 36, 15 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Simplifying activity-on-edge graphs. (English) Zbl 07759292

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 24, 14 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing directed Steiner path covers for directed co-graphs (extended abstract). (English) Zbl 1440.68188

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 556-565 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs. (English) Zbl 1450.05087

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 234-246 (2019).
MSC:  05C83 05C20 05C75
PDFBibTeX XMLCite
Full Text: DOI

Sharkovskii’s ordering and estimates of the number of periodic trajectories of given period of a self-map of an interval. (English. Russian original) Zbl 1427.37030

Vestn. St. Petersbg. Univ., Math. 52, No. 3, 281-285 (2019); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 6(64), No. 3, 422-429 (2019).
MSC:  37E05 37E15 37E25
PDFBibTeX XMLCite
Full Text: DOI

Directed path-width of sequence digraphs. (English) Zbl 1521.68099

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 79-93 (2018).
PDFBibTeX XMLCite
Full Text: DOI

The directed disjoint shortest paths problem. (English) Zbl 1445.68149

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 13, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Finding detours is fixed-parameter tractable. (English) Zbl 1441.68104

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 54, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

On sets and graphs. Perspectives on logic and combinatorics. (English) Zbl 1382.05002

Cham: Springer (ISBN 978-3-319-54980-4/hbk; 978-3-319-54981-1/ebook). xix, 275 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Complex networks: principles, methods and applications. (English) Zbl 1387.68003

Cambridge: Cambridge University Press (ISBN 978-1-107-10318-4/hbk; 978-1-316-21600-2/ebook). xxi, 559 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph. (English) Zbl 1398.05202

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 49, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field