×

Found 462 Documents (Results 1–100)

Face numbers: the upper bound side of the story. (English) Zbl 07821705

Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 6. Sections 12–14. Berlin: European Mathematical Society (EMS). 4622-4644 (2023).
PDFBibTeX XMLCite
Full Text: DOI

The open algebraic path problem. (English) Zbl 07774246

Gadducci, Fabio (ed.) et al., 9th conference on algebra and coalgebra in computer science, CALCO 2021, Salzburg, Austria, August 31 – September 3, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 211, Article 20, 20 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized complexity of geodetic set. (English) Zbl 07764111

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 20, 14 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

The bounded and precise word problems for presentations of groups. (English) Zbl 07213237

Memoirs of the American Mathematical Society 1281. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4143-2/pbk; 978-1-4704-5804-1/ebook). v, 106 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles. (English. Russian original) Zbl 1441.05095

Proc. Steklov Inst. Math. 307, Suppl. 1, S142-S150 (2019); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 24, No. 3, 272-280 (2018).
PDFBibTeX XMLCite
Full Text: DOI

An efficient algorithm for the fast delivery problem. (English) Zbl 1464.68277

Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 171-184 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Almost optimal distance oracles for planar graphs. (English) Zbl 1433.68284

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 138-151 (2019).
MSC:  68R10 68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

On restricted disjunctive temporal problems: faster algorithms and tractability frontier. (English) Zbl 1487.68211

Alechina, Natasha (ed.) et al., 25th international symposium on temporal representation and reasoning. TIME 2018, Warsaw, Poland, October 15–17, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 120, Article 10, 20 p. (2018).
MSC:  68T20 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Near-optimal distance emulator for planar graphs. (English) Zbl 1522.68390

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 16, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of finding small separators in temporal graphs. (English) Zbl 1512.68257

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 45, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Positive Grassmannian and polyhedral subdivisions. (English) Zbl 1448.05219

Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1–9, 2018. Volume IV. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 3181-3211 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing shortest paths in the plane with removable obstacles. (English) Zbl 1477.68454

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 5, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Shortest paths in the plane with obstacle violations. (English) Zbl 1442.68251

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 49, 14 p. (2017).
MSC:  68U05 68Q25
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

Improved distance queries and cycle counting by Frobenius normal form. (English) Zbl 1402.68107

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 56, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. (English) Zbl 1398.05074

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 24, 13 p. (2016).
MSC:  05C12 05C38 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Finding \(k\) simple shortest paths and cycles. (English) Zbl 1398.05190

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 8, 12 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deterministic decremental single source shortest paths: beyond the \(O(mn)\) bound. (English) Zbl 1376.68060

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 389-397 (2016).
MSC:  68Q25 05C85 68W25
PDFBibTeX XMLCite
Full Text: DOI

A preliminary analysis of the distance based critical node problem. (English) Zbl 1356.05030

Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 25-28 (2016).
MSC:  05C12 05C38 90C27
PDFBibTeX XMLCite
Full Text: DOI

On the path avoiding forbidden pairs polytope. (English) Zbl 1347.05100

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 343-348, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

Fast partial distance estimation and applications. (English) Zbl 1333.68280

Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC ’15, Donostia-San Sebastián, Spain, July 21–23, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3617-8). 153-162 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

New routing techniques and their applications. (English) Zbl 1333.05298

Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC ’15, Donostia-San Sebastián, Spain, July 21–23, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3617-8). 23-32 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software