×

Found 80 Documents (Results 1–80)

Efficient enumeration of drawings and combinatorial structures for maximal planar graphs. (English) Zbl 07883880

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 18th international conference and workshops on algorithms and computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024. Proceedings. Singapore: Springer. Lect. Notes Comput. Sci. 14549, 350-364 (2024).
MSC:  68Wxx

Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (English) Zbl 1490.91144

Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 281-295 (2021).
MSC:  91B68

Eilenberg theorems for free. (English) Zbl 1441.68139

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 43, 15 p. (2017).
MSC:  68Q70

Shortest reconfiguration paths in the solution space of Boolean formulas. (English) Zbl 1374.68246

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 985-996 (2015).
MSC:  68Q25 68Q17

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software