Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski, and Aneta Żuk. List Locally Surjective Homomorphisms in Hereditary Graph Classes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.ISAAC.2022.30, author = {Dvo\v{r}\'{a}k, Pavel and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Novotn\'{a}, Jana and Krawczyk, Monika and Rz\k{a}\.{z}ewski, Pawe{\l} and \.{Z}uk, Aneta}, title = {{List Locally Surjective Homomorphisms in Hereditary Graph Classes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.30}, URN = {urn:nbn:de:0030-drops-173154}, doi = {10.4230/LIPIcs.ISAAC.2022.30}, annote = {Keywords: Homomorphism, Hereditary graphs, Subexponential-time algorithms} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Krishnendu Chatterjee, Monika Henzinger, Sagar Sudhir Kale, and Alexander Svozil. Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 124:1-124:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chatterjee_et_al:LIPIcs.ICALP.2021.124, author = {Chatterjee, Krishnendu and Henzinger, Monika and Kale, Sagar Sudhir and Svozil, Alexander}, title = {{Faster Algorithms for Bounded Liveness in Graphs and Game Graphs}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {124:1--124:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.124}, URN = {urn:nbn:de:0030-drops-141930}, doi = {10.4230/LIPIcs.ICALP.2021.124}, annote = {Keywords: Graphs, Game Graphs, B\"{u}chi} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Mónika Csikós and Nabil H. Mustafa. Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{csikos_et_al:LIPIcs.SoCG.2021.28, author = {Csik\'{o}s, M\'{o}nika and Mustafa, Nabil H.}, title = {{Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.28}, URN = {urn:nbn:de:0030-drops-138273}, doi = {10.4230/LIPIcs.SoCG.2021.28}, annote = {Keywords: Matchings, crossing numbers, approximations} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Monika Henzinger, Stefan Neumann, and Andreas Wiese. Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{henzinger_et_al:LIPIcs.SoCG.2020.51, author = {Henzinger, Monika and Neumann, Stefan and Wiese, Andreas}, title = {{Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.51}, URN = {urn:nbn:de:0030-drops-122094}, doi = {10.4230/LIPIcs.SoCG.2020.51}, annote = {Keywords: Dynamic algorithms, independent set, approximation algorithms, interval graphs, geometric intersection graphs} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Myeong-Hun Jeong, Junjun Yin, and Shaowen Wang. Outlier Detection and Comparison of Origin-Destination Flows Using Data Depth. In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jeong_et_al:LIPIcs.GISCIENCE.2018.6, author = {Jeong, Myeong-Hun and Yin, Junjun and Wang, Shaowen}, title = {{Outlier Detection and Comparison of Origin-Destination Flows Using Data Depth}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.6}, URN = {urn:nbn:de:0030-drops-93341}, doi = {10.4230/LIPIcs.GISCIENCE.2018.6}, annote = {Keywords: Movement Analysis, Trajectory Data Mining, Data Depth, Outlier Detection} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Devanjan Bhattacharya and Marco Painho. Design for Geospatially Enabled Climate Modeling and Alert System (CLIMSYS): A Position Paper (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 22:1-22:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhattacharya_et_al:LIPIcs.GISCIENCE.2018.22, author = {Bhattacharya, Devanjan and Painho, Marco}, title = {{Design for Geospatially Enabled Climate Modeling and Alert System (CLIMSYS): A Position Paper}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {22:1--22:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.22}, URN = {urn:nbn:de:0030-drops-93504}, doi = {10.4230/LIPIcs.GISCIENCE.2018.22}, annote = {Keywords: Spatial enablement, climate modeling, natural hazards, spatial data infrastructure, sensor web} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Irene M. Johannsen, Sara Irina Fabrikant, and Mariele Evers. How Do Texture and Color Communicate Uncertainty in Climate Change Map Displays? (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 37:1-37:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{johannsen_et_al:LIPIcs.GISCIENCE.2018.37, author = {Johannsen, Irene M. and Fabrikant, Sara Irina and Evers, Mariele}, title = {{How Do Texture and Color Communicate Uncertainty in Climate Change Map Displays?}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {37:1--37:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.37}, URN = {urn:nbn:de:0030-drops-93655}, doi = {10.4230/LIPIcs.GISCIENCE.2018.37}, annote = {Keywords: uncertainty visualization, empirical study, visual variables, climate change} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Krishnendu Chatterjee, Monika Henzinger, and Alexander Svozil. Faster Algorithms for Mean-Payoff Parity Games. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2017.39, author = {Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander}, title = {{Faster Algorithms for Mean-Payoff Parity Games}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.39}, URN = {urn:nbn:de:0030-drops-80809}, doi = {10.4230/LIPIcs.MFCS.2017.39}, annote = {Keywords: graph games, mean-payoff parity games} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Monika Henzinger and Stefan Neumann. Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 48:1-48:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2016.48, author = {Henzinger, Monika and Neumann, Stefan}, title = {{Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {48:1--48:11}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.48}, URN = {urn:nbn:de:0030-drops-63607}, doi = {10.4230/LIPIcs.ESA.2016.48}, annote = {Keywords: connectivity, emergency planning, sensitivity} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Paul Dütting, Monika Henzinger, and Ingmar Weber. Sponsored Search, Market Equilibria, and the Hungarian Method. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 287-298, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{dutting_et_al:LIPIcs.STACS.2010.2463, author = {D\"{u}tting, Paul and Henzinger, Monika and Weber, Ingmar}, title = {{Sponsored Search, Market Equilibria, and the Hungarian Method}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {287--298}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2463}, URN = {urn:nbn:de:0030-drops-24636}, doi = {10.4230/LIPIcs.STACS.2010.2463}, annote = {Keywords: Stable matching, truthful matching mechanism, general position} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Monika Dörfler and Bruno Torrésani. Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{dorfler_et_al:DagSemProc.08492.7, author = {D\"{o}rfler, Monika and Torr\'{e}sani, Bruno}, title = {{Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--28}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8492}, editor = {Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.7}, URN = {urn:nbn:de:0030-drops-18808}, doi = {10.4230/DagSemProc.08492.7}, annote = {Keywords: Operator approximation, generalized Gabor multipliers, spreading function, twisted convolution} }
Published in: Dagstuhl Seminar Proceedings, Volume 6101, Spatial Data: mining, processing and communicating (2006)
Jörg-Rüdiger Sack, Monika Sester, Michael Worboys, and Peter van Oosterom. 06101 Report – Spatial Data: mining, processing and communicating. In Spatial Data: mining, processing and communicating. Dagstuhl Seminar Proceedings, Volume 6101, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{sack_et_al:DagSemProc.06101.2, author = {Sack, J\"{o}rg-R\"{u}diger and Sester, Monika and Worboys, Michael and van Oosterom, Peter}, title = {{06101 Report – Spatial Data: mining, processing and communicating}}, booktitle = {Spatial Data: mining, processing and communicating}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6101}, editor = {J\"{o}rg-R\"{u}diger Sack and Monika Sester and Peter van Oosterom and Michael Worboys}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06101.2}, URN = {urn:nbn:de:0030-drops-5908}, doi = {10.4230/DagSemProc.06101.2}, annote = {Keywords: Data mining, digital cartography, data interpretation, spatial data} }
Feedback for Dagstuhl Publishing