Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Zdenek Dvorák, Petr Hlinený, and Bojan Mohar. Structure and Generation of Crossing-Critical Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2018.33, author = {Dvor\'{a}k, Zdenek and Hlinen\'{y}, Petr and Mohar, Bojan}, title = {{Structure and Generation of Crossing-Critical Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.33}, URN = {urn:nbn:de:0030-drops-87460}, doi = {10.4230/LIPIcs.SoCG.2018.33}, annote = {Keywords: crossing number, crossing-critical, path-width, exhaustive generation} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Onur Cagirici, Petr Hlinený, and Bodhayan Roy. On Colourability of Polygon Visibility Graphs. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cagirici_et_al:LIPIcs.FSTTCS.2017.21, author = {Cagirici, Onur and Hlinen\'{y}, Petr and Roy, Bodhayan}, title = {{On Colourability of Polygon Visibility Graphs}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.21}, URN = {urn:nbn:de:0030-drops-83814}, doi = {10.4230/LIPIcs.FSTTCS.2017.21}, annote = {Keywords: polygon visibility graph, graph coloring, NP-completeness} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Markus Chimani and Petr Hlinený. Inserting Multiple Edges into a Planar Graph. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chimani_et_al:LIPIcs.SoCG.2016.30, author = {Chimani, Markus and Hlinen\'{y}, Petr}, title = {{Inserting Multiple Edges into a Planar Graph}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.30}, URN = {urn:nbn:de:0030-drops-59223}, doi = {10.4230/LIPIcs.SoCG.2016.30}, annote = {Keywords: crossing number, edge insertion, parameterized complexity, path homotopy, funnel algorithm} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Petr Hlinený and Marek Dernár. Crossing Number is Hard for Kernelization. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 42:1-42:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hlineny_et_al:LIPIcs.SoCG.2016.42, author = {Hlinen\'{y}, Petr and Dern\'{a}r, Marek}, title = {{Crossing Number is Hard for Kernelization}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {42:1--42:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.42}, URN = {urn:nbn:de:0030-drops-59347}, doi = {10.4230/LIPIcs.SoCG.2016.42}, annote = {Keywords: crossing number; tile crossing number; parameterized complexity; polynomial kernel; cross-composition} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Proceedings{hlineny_et_al:OASIcs.MEMICS.2009, title = {{OASIcs, Volume 13, MEMICS'09, Complete Volume}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2012}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.MEMICS.2009}, URN = {urn:nbn:de:0030-drops-35756}, doi = {10.4230/OASIcs.MEMICS.2009}, annote = {Keywords: Mathematics of Computing, Physical Sciences and Engineering} }
Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Robert Ganian, Petr Hlinený, and Jan Obdrzálek. Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 73-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{ganian_et_al:LIPIcs.FSTTCS.2010.73, author = {Ganian, Robert and Hlinen\'{y}, Petr and Obdrz\'{a}lek, Jan}, title = {{Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {73--83}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.73}, URN = {urn:nbn:de:0030-drops-28541}, doi = {10.4230/LIPIcs.FSTTCS.2010.73}, annote = {Keywords: propositional model counting; satisfiability; rank-width; clique-width ; parameterized complexity} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. i-vi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hlineny_et_al:OASIcs:2009:DROPS.MEMICS.2009.2342, author = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, title = {{Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {i--vi}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2342}, URN = {urn:nbn:de:0030-drops-23425}, doi = {10.4230/DROPS.MEMICS.2009.2342}, annote = {Keywords: MEMICS 2009} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Marián Novotný. A Privacy-Aware Protocol for Sociometric Questionnaires. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{novotny:OASIcs:2009:DROPS.MEMICS.2009.2355, author = {Novotn\'{y}, Mari\'{a}n}, title = {{A Privacy-Aware Protocol for Sociometric Questionnaires}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {1--9}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2355}, URN = {urn:nbn:de:0030-drops-23551}, doi = {10.4230/DROPS.MEMICS.2009.2355}, annote = {Keywords: Sociometry, sociogram, privacy, homomorphic encryption, security protocols} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Kim G. Larsen, Uli Fahrenberg, and Claus Thrane. A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 10-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{larsen_et_al:OASIcs:2009:DROPS.MEMICS.2009.2345, author = {Larsen, Kim G. and Fahrenberg, Uli and Thrane, Claus}, title = {{A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {10--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2345}, URN = {urn:nbn:de:0030-drops-23454}, doi = {10.4230/DROPS.MEMICS.2009.2345}, annote = {Keywords: Quantitative analysis, Kripke structures, characteristic formulae, bisimulation distance, weighted CTL} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Andreas Gaiser and Stefan Schwoon. Comparison of Algorithms for Checking Emptiness on Büchi Automata. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 18-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gaiser_et_al:OASIcs:2009:DROPS.MEMICS.2009.2349, author = {Gaiser, Andreas and Schwoon, Stefan}, title = {{Comparison of Algorithms for Checking Emptiness on B\"{u}chi Automata}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {18--26}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2349}, URN = {urn:nbn:de:0030-drops-23494}, doi = {10.4230/DROPS.MEMICS.2009.2349}, annote = {Keywords: LTL Model checking, Depth first search} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Ota Jirák and Dušan Kolář. Derivation in Scattered Context Grammar via Lazy Function Evaluation. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 27-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{jirak_et_al:OASIcs:2009:DROPS.MEMICS.2009.2351, author = {Jir\'{a}k, Ota and Kol\'{a}\v{r}, Du\v{s}an}, title = {{Derivation in Scattered Context Grammar via Lazy Function Evaluation}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {27--36}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2351}, URN = {urn:nbn:de:0030-drops-23517}, doi = {10.4230/DROPS.MEMICS.2009.2351}, annote = {Keywords: SCG, delayed execution, derivation, lazy evaluation} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Marek Bĕhálek and Petr Šaloun. Embedded Process Functional Language. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 37-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{behalek_et_al:OASIcs:2009:DROPS.MEMICS.2009.2353, author = {B\u{e}h\'{a}lek, Marek and \v{S}aloun, Petr}, title = {{Embedded Process Functional Language}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {37--44}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2353}, URN = {urn:nbn:de:0030-drops-23535}, doi = {10.4230/DROPS.MEMICS.2009.2353}, annote = {Keywords: Embedded systems, model, high abstraction level, functional programming} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Alina Vasilieva. Exact Quantum Query Algorithm for Error Detection Code Verification. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 45-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{vasilieva:OASIcs:2009:DROPS.MEMICS.2009.2343, author = {Vasilieva, Alina}, title = {{Exact Quantum Query Algorithm for Error Detection Code Verification}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {45--52}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2343}, URN = {urn:nbn:de:0030-drops-23434}, doi = {10.4230/DROPS.MEMICS.2009.2343}, annote = {Keywords: Quantum computing, quantum query algorithms, algorithm complexity, Boolean functions, algorithm design} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Jakub Chaloupka and Luboš Brim. Faster Algorithm for Mean-Payoff Games. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 53-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{chaloupka_et_al:OASIcs:2009:DROPS.MEMICS.2009.2348, author = {Chaloupka, Jakub and Brim, Lubo\v{s}}, title = {{Faster Algorithm for Mean-Payoff Games}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {53--61}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2348}, URN = {urn:nbn:de:0030-drops-23481}, doi = {10.4230/DROPS.MEMICS.2009.2348}, annote = {Keywords: Mean-payoff games, randomized algorithms, computational complexity} }
Published in: OASIcs, Volume 13, Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (2009)
Andriy Stetsko and Václav Matyáš. One size does not fit all - how to approach intrusion detection in wireless sensor networks. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 62-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{stetsko_et_al:OASIcs:2009:DROPS.MEMICS.2009.2347, author = {Stetsko, Andriy and Maty\'{a}\v{s}, V\'{a}clav}, title = {{One size does not fit all - how to approach intrusion detection in wireless sensor networks}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {62--69}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2347}, URN = {urn:nbn:de:0030-drops-23479}, doi = {10.4230/DROPS.MEMICS.2009.2347}, annote = {Keywords: Intrusion detection, wireless sensor networks} }
Feedback for Dagstuhl Publishing