Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Markus Chimani and Tilo Wiedera. Stronger ILPs for the Graph Genus Problem. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 30:1-30:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{chimani_et_al:LIPIcs.ESA.2019.30, author = {Chimani, Markus and Wiedera, Tilo}, title = {{Stronger ILPs for the Graph Genus Problem}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.30}, URN = {urn:nbn:de:0030-drops-111511}, doi = {10.4230/LIPIcs.ESA.2019.30}, annote = {Keywords: algorithm engineering, genus, integer linear programming} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Drago Bokal, Zdeněk Dvořák, Petr Hliněný, Jesús Leaños, Bojan Mohar, and Tilo Wiedera. Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 14:1-14:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{bokal_et_al:LIPIcs.SoCG.2019.14, author = {Bokal, Drago and Dvo\v{r}\'{a}k, Zden\v{e}k and Hlin\v{e}n\'{y}, Petr and Lea\~{n}os, Jes\'{u}s and Mohar, Bojan and Wiedera, Tilo}, title = {{Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \langle= 12}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.14}, URN = {urn:nbn:de:0030-drops-104183}, doi = {10.4230/LIPIcs.SoCG.2019.14}, annote = {Keywords: graph drawing, crossing number, crossing-critical, zip product} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Markus Chimani and Tilo Wiedera. Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chimani_et_al:LIPIcs.ESA.2018.19, author = {Chimani, Markus and Wiedera, Tilo}, title = {{Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.19}, URN = {urn:nbn:de:0030-drops-94829}, doi = {10.4230/LIPIcs.ESA.2018.19}, annote = {Keywords: algorithm engineering, graph algorithms, integer linear programming, maximum planar subgraph} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Markus Chimani, Ivo Hedtke, and Tilo Wiedera. Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 22:1-22:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chimani_et_al:LIPIcs.SEA.2018.22, author = {Chimani, Markus and Hedtke, Ivo and Wiedera, Tilo}, title = {{Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.22}, URN = {urn:nbn:de:0030-drops-89572}, doi = {10.4230/LIPIcs.SEA.2018.22}, annote = {Keywords: maximum planar subgraph, integer linear programming, pseudo boolean satisfiability, graph drawing, algorithm engineering} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Markus Chimani and Tilo Wiedera. An ILP-based Proof System for the Crossing Number Problem. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 29:1-29:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chimani_et_al:LIPIcs.ESA.2016.29, author = {Chimani, Markus and Wiedera, Tilo}, title = {{An ILP-based Proof System for the Crossing Number Problem}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.29}, URN = {urn:nbn:de:0030-drops-63803}, doi = {10.4230/LIPIcs.ESA.2016.29}, annote = {Keywords: automatic formal proof, crossing number, integer linear programming} }
Feedback for Dagstuhl Publishing