Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michael Kaufmann 0001
@article{DBLP:journals/algorithmica/AlamBGKP23,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Lazy Queue Layouts of Posets},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1176--1201},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01067-y},
doi = {10.1007/S00453-022-01067-Y},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlamBGKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DidimoKLO23,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel
Graphs in Linear Time},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2605--2666},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01110-6},
doi = {10.1007/S00453-023-01110-6},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DidimoKLO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cga/AhmedABBKKKNSVW23,
author = {Abu Reyan Ahmed and
Patrizio Angelini and
Michael A. Bekos and
Giuseppe Di Battista and
Michael Kaufmann and
Philipp Kindermann and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg and
Antonios Symvonis and
Ana{\"{\i}}s Villedieu and
Markus Wallinger},
title = {Splitting Vertices in 2-Layer Graph Drawings},
journal = {{IEEE} Computer Graphics and Applications},
volume = {43},
number = {3},
pages = {24--35},
year = {2023},
url = {https://doi.org/10.1109/MCG.2023.3264244},
doi = {10.1109/MCG.2023.3264244},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cga/AhmedABBKKKNSVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BinucciGKLT23,
author = {Carla Binucci and
Emilio Di Giacomo and
Michael Kaufmann and
Giuseppe Liotta and
Alessandra Tappini},
title = {k-Planar Placement and Packing of {\(\Delta\)}-Regular Caterpillars},
journal = {Int. J. Found. Comput. Sci.},
volume = {34},
number = {7},
pages = {875--902},
year = {2023},
url = {https://doi.org/10.1142/S0129054123420042},
doi = {10.1142/S0129054123420042},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BinucciGKLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoKLO23,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Rectilinear Planarity of Partial 2-Trees},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {679--719},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00640},
doi = {10.7155/JGAA.00640},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoKLO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AngeliniBK00U23,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Axis-Parallel Right Angle Crossing Graphs},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.9},
doi = {10.4230/LIPICS.ESA.2023.9},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/AngeliniBK00U23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BinucciBBDDHKLMT23,
author = {Carla Binucci and
Aaron B{\"{u}}ngener and
Giuseppe Di Battista and
Walter Didimo and
Vida Dujmovic and
Seok{-}Hee Hong and
Michael Kaufmann and
Giuseppe Liotta and
Pat Morin and
Alessandra Tappini},
editor = {Michael A. Bekos and
Markus Chimani},
title = {Min-k-planar Drawings of Graphs},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14465},
pages = {39--52},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49272-3\_3},
doi = {10.1007/978-3-031-49272-3\_3},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BinucciBBDDHKLMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Didimo0LOP23,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali and
Maurizio Patrignani},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Rectilinear-Upward Planarity Testing of Digraphs},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {26:1--26:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.26},
doi = {10.4230/LIPICS.ISAAC.2023.26},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Didimo0LOP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BekosFKKKKS23,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann and
Stephen G. Kobourov and
Myroslav Kryven and
Axel Kuckuk and
Lena Schlipf},
editor = {Leszek Gasieniec},
title = {On the 2-Layer Window Width Minimization Problem},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {209--221},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_14},
doi = {10.1007/978-3-031-23101-8\_14},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BekosFKKKKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ForsterKMPR23,
author = {Henry F{\"{o}}rster and
Michael Kaufmann and
Laura Merker and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou},
editor = {Pat Morin and
Subhash Suri},
title = {Linear Layouts of Bipartite Planar Graphs},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {444--459},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_29},
doi = {10.1007/978-3-031-38906-1\_29},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ForsterKMPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Kaufmann23,
author = {Michael Kaufmann},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {The Family of Fan-Planar Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {12--19},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_2},
doi = {10.1007/978-3-031-27051-2\_2},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Kaufmann23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BinucciBDHKLMT23,
author = {Carla Binucci and
Giuseppe Di Battista and
Walter Didimo and
Seok{-}Hee Hong and
Michael Kaufmann and
Giuseppe Liotta and
Pat Morin and
Alessandra Tappini},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Nonplanar Graph Drawings with k Vertices per Face},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {86--100},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_7},
doi = {10.1007/978-3-031-43380-1\_7},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BinucciBDHKLMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-01226,
author = {Carla Binucci and
Emilio Di Giacomo and
Michael Kaufmann and
Giuseppe Liotta and
Alessandra Tappini},
title = {k-planar Placement and Packing of {\(\Delta\)}-regular Caterpillars},
journal = {CoRR},
volume = {abs/2301.01226},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.01226},
doi = {10.48550/ARXIV.2301.01226},
eprinttype = {arXiv},
eprint = {2301.01226},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-01226.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10872,
author = {Abu Reyan Ahmed and
Patrizio Angelini and
Michael A. Bekos and
Giuseppe Di Battista and
Michael Kaufmann and
Philipp Kindermann and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg and
Antonios Symvonis and
Ana{\"{\i}}s Villedieu and
Markus Wallinger},
title = {Splitting Vertices in 2-Layer Graph Drawings},
journal = {CoRR},
volume = {abs/2301.10872},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10872},
doi = {10.48550/ARXIV.2301.10872},
eprinttype = {arXiv},
eprint = {2301.10872},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10872.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-16087,
author = {Henry F{\"{o}}rster and
Michael Kaufmann and
Laura Merker and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou},
title = {Linear Layouts of Bipartite Planar Graphs},
journal = {CoRR},
volume = {abs/2305.16087},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.16087},
doi = {10.48550/ARXIV.2305.16087},
eprinttype = {arXiv},
eprint = {2305.16087},
timestamp = {Tue, 06 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-16087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-15395,
author = {Michael A. Bekos and
Michael Kaufmann and
Maria Eleni Pavlidi and
Xenia Rieger},
title = {On the Deque and Rique Numbers of Complete and Complete Bipartite
Graphs},
journal = {CoRR},
volume = {abs/2306.15395},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.15395},
doi = {10.48550/ARXIV.2306.15395},
eprinttype = {arXiv},
eprint = {2306.15395},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-15395.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-17073,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
title = {Axis-Parallel Right Angle Crossing Graphs},
journal = {CoRR},
volume = {abs/2306.17073},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.17073},
doi = {10.48550/ARXIV.2306.17073},
eprinttype = {arXiv},
eprint = {2306.17073},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-17073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13401,
author = {Carla Binucci and
Aaron B{\"{u}}ngener and
Giuseppe Di Battista and
Walter Didimo and
Vida Dujmovic and
Seok{-}Hee Hong and
Michael Kaufmann and
Giuseppe Liotta and
Pat Morin and
Alessandra Tappini},
title = {Min-k-planar Drawings of Graphs},
journal = {CoRR},
volume = {abs/2308.13401},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13401},
doi = {10.48550/ARXIV.2308.13401},
eprinttype = {arXiv},
eprint = {2308.13401},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-06193,
author = {Michael Kaufmann and
Boris Klemz and
Kristin Knorr and
Meghana M. Reddy and
Felix Schr{\"{o}}der and
Torsten Ueckerdt},
title = {The Density Formula: One Lemma to Bound Them All},
journal = {CoRR},
volume = {abs/2311.06193},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.06193},
doi = {10.48550/ARXIV.2311.06193},
eprinttype = {arXiv},
eprint = {2311.06193},
timestamp = {Thu, 16 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-06193.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/BinucciDKLM22,
author = {Carla Binucci and
Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Fabrizio Montecchiani},
title = {Placing Arrows in Directed Graph Layouts: Algorithms and Experiments},
journal = {Comput. Graph. Forum},
volume = {41},
number = {1},
pages = {364--376},
year = {2022},
url = {https://doi.org/10.1111/cgf.14440},
doi = {10.1111/CGF.14440},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/BinucciDKLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/0001U22,
author = {Michael Kaufmann and
Torsten Ueckerdt},
title = {The Density of Fan-Planar Graphs},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10521},
doi = {10.37236/10521},
timestamp = {Fri, 04 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/0001U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlamBGKP22,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {The mixed page number of graphs},
journal = {Theor. Comput. Sci.},
volume = {931},
pages = {131--141},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.036},
doi = {10.1016/J.TCS.2022.07.036},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlamBGKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DidimoKLO22,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
editor = {Patrizio Angelini and
Reinhard von Hanxleden},
title = {Rectilinear Planarity of Partial 2-Trees},
booktitle = {Graph Drawing and Network Visualization - 30th International Symposium,
{GD} 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13764},
pages = {157--172},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22203-0\_12},
doi = {10.1007/978-3-031-22203-0\_12},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DidimoKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BekosLH022,
author = {Michael A. Bekos and
Giordano Da Lozzo and
Petr Hlinen{\'{y}} and
Michael Kaufmann},
editor = {Sang Won Bae and
Heejin Park},
title = {Graph Product Structure for h-Framed Graphs},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {23:1--23:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.23},
doi = {10.4230/LIPICS.ISAAC.2022.23},
timestamp = {Wed, 14 Dec 2022 11:53:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BekosLH022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AngeliniBKKP22,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {{RAC} Drawings of Graphs with Low Degree},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {11:1--11:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.11},
doi = {10.4230/LIPICS.MFCS.2022.11},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AngeliniBKKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2022,
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5},
doi = {10.1007/978-3-031-15914-5},
isbn = {978-3-031-15913-8},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11495,
author = {Michael A. Bekos and
Giordano Da Lozzo and
Petr Hlinen{\'{y}} and
Michael Kaufmann},
title = {Graph Product Structure for h-Framed Graphs},
journal = {CoRR},
volume = {abs/2204.11495},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11495},
doi = {10.48550/ARXIV.2204.11495},
eprinttype = {arXiv},
eprint = {2204.11495},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-07500,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel
Graphs in Linear Time},
journal = {CoRR},
volume = {abs/2205.07500},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.07500},
doi = {10.48550/ARXIV.2205.07500},
eprinttype = {arXiv},
eprint = {2205.07500},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-07500.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-14909,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister},
title = {{RAC} Drawings of Graphs with Low Degree},
journal = {CoRR},
volume = {abs/2206.14909},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.14909},
doi = {10.48550/ARXIV.2206.14909},
eprinttype = {arXiv},
eprint = {2206.14909},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-14909.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-12558,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Rectilinear Planarity of Partial 2-Trees},
journal = {CoRR},
volume = {abs/2208.12558},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.12558},
doi = {10.48550/ARXIV.2208.12558},
eprinttype = {arXiv},
eprint = {2208.12558},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-12558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/BekosFGHKSS21,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Christian Geckeler and
Lukas Holl{\"{a}}nder and
Michael Kaufmann and
Amad{\"{a}}us M. Spallek and
Jan Splett},
title = {A Heuristic Approach Towards Drawings of Graphs With High Crossing
Resolution},
journal = {Comput. J.},
volume = {64},
number = {1},
pages = {7--26},
year = {2021},
url = {https://doi.org/10.1093/comjnl/bxz133},
doi = {10.1093/COMJNL/BXZ133},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/BekosFGHKSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ivs/GiacomoDKL21,
author = {Emilio Di Giacomo and
Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta},
title = {Stable visualization of connected components in dynamic graphs},
journal = {Inf. Vis.},
volume = {20},
number = {1},
pages = {3--19},
year = {2021},
url = {https://doi.org/10.1177/1473871620972339},
doi = {10.1177/1473871620972339},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ivs/GiacomoDKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannPTU21,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
title = {The number of crossings in multigraphs with no empty lens},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {383--396},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00563},
doi = {10.7155/JGAA.00563},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannPTU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannKLMRV21,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
title = {The Stub Resolution of 1-planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {625--642},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00575},
doi = {10.7155/JGAA.00575},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannKLMRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlamBDGKP21,
author = {Muhammad Jawaherul Alam and
Michael A. Bekos and
Vida Dujmovic and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {On dispersable book embeddings},
journal = {Theor. Comput. Sci.},
volume = {861},
pages = {1--22},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.01.035},
doi = {10.1016/J.TCS.2021.01.035},
timestamp = {Fri, 05 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlamBDGKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Forster0R21,
author = {Henry F{\"{o}}rster and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
editor = {Helen C. Purchase and
Ignaz Rutter},
title = {Recognizing and Embedding Simple Optimal 2-Planar Graphs},
booktitle = {Graph Drawing and Network Visualization - 29th International Symposium,
{GD} 2021, T{\"{u}}bingen, Germany, September 14-17, 2021, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12868},
pages = {87--100},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92931-2\_6},
doi = {10.1007/978-3-030-92931-2\_6},
timestamp = {Sun, 13 Nov 2022 09:57:23 +0100},
biburl = {https://dblp.org/rec/conf/gd/Forster0R21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/FrankKKMPUW21,
author = {Fabian Frank and
Michael Kaufmann and
Stephen G. Kobourov and
Tamara Mchedlidze and
Sergey Pupyrev and
Torsten Ueckerdt and
Alexander Wolff},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Using the Metro-Map Metaphor for Drawing Hypergraphs},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {361--372},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_26},
doi = {10.1007/978-3-030-67731-2\_26},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/FrankKKMPUW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04993,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {The Mixed Page Number of Graphs},
journal = {CoRR},
volume = {abs/2107.04993},
year = {2021},
url = {https://arxiv.org/abs/2107.04993},
eprinttype = {arXiv},
eprint = {2107.04993},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-00665,
author = {Henry F{\"{o}}rster and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {Recognizing and Embedding Simple Optimal 2-Planar Graphs},
journal = {CoRR},
volume = {abs/2108.00665},
year = {2021},
url = {https://arxiv.org/abs/2108.00665},
eprinttype = {arXiv},
eprint = {2108.00665},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-00665.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-00548,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Spirality and Rectilinear Planarity Testing of Independent-Parallel
SP-Graphs},
journal = {CoRR},
volume = {abs/2110.00548},
year = {2021},
url = {https://arxiv.org/abs/2110.00548},
eprinttype = {arXiv},
eprint = {2110.00548},
timestamp = {Fri, 08 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-00548.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlamBGKP20,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Queue Layouts of Planar 3-Trees},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2564--2585},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00697-4},
doi = {10.1007/S00453-020-00697-4},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlamBGKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniBKS20,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Thomas Schneck},
title = {Efficient Generation of Different Topological Representations of Graphs
Beyond-Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {573--601},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00531},
doi = {10.7155/JGAA.00531},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniBKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KaufmannBKPRU20,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Four Pages Are Indeed Necessary for Planar Graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {332--353},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a12},
doi = {10.20382/JOCG.V11I1A12},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KaufmannBKPRU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngeliniBFK20,
author = {Patrizio Angelini and
Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
title = {On {RAC} drawings of graphs with one bend per edge},
journal = {Theor. Comput. Sci.},
volume = {828-829},
pages = {42--54},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.04.018},
doi = {10.1016/J.TCS.2020.04.018},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngeliniBFK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Forster020,
author = {Henry F{\"{o}}rster and
Michael Kaufmann},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {On Compact {RAC} Drawings},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {53:1--53:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.53},
doi = {10.4230/LIPICS.ESA.2020.53},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Forster020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlamBG0P20,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
editor = {David Auber and
Pavel Valtr},
title = {Lazy Queue Layouts of Posets},
booktitle = {Graph Drawing and Network Visualization - 28th International Symposium,
{GD} 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12590},
pages = {55--68},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-68766-3\_5},
doi = {10.1007/978-3-030-68766-3\_5},
timestamp = {Tue, 27 Dec 2022 18:26:56 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlamBG0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Didimo0LO20,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
editor = {David Auber and
Pavel Valtr},
title = {Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear
Time},
booktitle = {Graph Drawing and Network Visualization - 28th International Symposium,
{GD} 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12590},
pages = {436--449},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-68766-3\_34},
doi = {10.1007/978-3-030-68766-3\_34},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Didimo0LO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BiedlC0MNR20,
author = {Therese Biedl and
Steven Chaplick and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Chrysanthi N. Raftopoulou},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Layered Fan-Planar Graph Drawings},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {14:1--14:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.14},
doi = {10.4230/LIPICS.MFCS.2020.14},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BiedlC0MNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/0001KLMRV20,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
editor = {M. Sohel Rahman and
Kunihiko Sadakane and
Wing{-}Kin Sung},
title = {The Stub Resolution of 1-Planar Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 14th International Conference,
{WALCOM} 2020, Singapore, March 31 - April 2, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12049},
pages = {170--182},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39881-1\_15},
doi = {10.1007/978-3-030-39881-1\_15},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/0001KLMRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-09597,
author = {Therese Biedl and
Steven Chaplick and
Jir{\'{\i}} Fiala and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Chrysanthi N. Raftopoulou},
title = {On Layered Fan-Planar Graph Drawings},
journal = {CoRR},
volume = {abs/2002.09597},
year = {2020},
url = {https://arxiv.org/abs/2002.09597},
eprinttype = {arXiv},
eprint = {2002.09597},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-09597.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-05332,
author = {Steven Chaplick and
Henry F{\"{o}}rster and
Michael Hoffmann and
Michael Kaufmann},
title = {Monotone Arc Diagrams with few Biarcs},
journal = {CoRR},
volume = {abs/2003.05332},
year = {2020},
url = {https://arxiv.org/abs/2003.05332},
eprinttype = {arXiv},
eprint = {2003.05332},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-05332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-09642,
author = {Michael A. Bekos and
Mirco Haug and
Michael Kaufmann and
Julia M{\"{a}}nnecke},
title = {An Online Framework to Interact and Efficiently Compute Linear Layouts
of Graphs},
journal = {CoRR},
volume = {abs/2003.09642},
year = {2020},
url = {https://arxiv.org/abs/2003.09642},
eprinttype = {arXiv},
eprint = {2003.09642},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-09642.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07630,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Four Pages Are Indeed Necessary for Planar Graphs},
journal = {CoRR},
volume = {abs/2004.07630},
year = {2020},
url = {https://arxiv.org/abs/2004.07630},
eprinttype = {arXiv},
eprint = {2004.07630},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07630.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03784,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear
Time},
journal = {CoRR},
volume = {abs/2008.03784},
year = {2020},
url = {https://arxiv.org/abs/2008.03784},
eprinttype = {arXiv},
eprint = {2008.03784},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-10336,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Lazy Queue Layouts of Posets},
journal = {CoRR},
volume = {abs/2008.10336},
year = {2020},
url = {https://arxiv.org/abs/2008.10336},
eprinttype = {arXiv},
eprint = {2008.10336},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-10336.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosFK19,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
title = {On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity
and Kandinsky Drawings},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2046--2071},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0523-5},
doi = {10.1007/S00453-018-0523-5},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngeliniBKM19,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {On 3D visibility representations of graphs with few crossings per
edge},
journal = {Theor. Comput. Sci.},
volume = {784},
pages = {11--20},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.03.029},
doi = {10.1016/J.TCS.2019.03.029},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngeliniBKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniB0S19,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Thomas Schneck},
editor = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {Efficient Generation of Different Topological Representations of Graphs
Beyond-Planarity},
booktitle = {Graph Drawing and Network Visualization - 27th International Symposium,
{GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {253--267},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35802-0\_20},
doi = {10.1007/978-3-030-35802-0\_20},
timestamp = {Sun, 13 Nov 2022 09:57:24 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniB0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniF00KLP19,
author = {Patrizio Angelini and
Henry F{\"{o}}rster and
Michael Hoffmann and
Michael Kaufmann and
Stephen G. Kobourov and
Giuseppe Liotta and
Maurizio Patrignani},
editor = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {The QuaSEFE Problem},
booktitle = {Graph Drawing and Network Visualization - 27th International Symposium,
{GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {268--275},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35802-0\_21},
doi = {10.1007/978-3-030-35802-0\_21},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniF00KLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Kaufmann19,
author = {Michael Kaufmann},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {260--271},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_21},
doi = {10.1007/978-3-030-10801-4\_21},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Kaufmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-03042,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Thomas Schneck},
title = {Efficient Generation of Different Topological Representations of Graphs
Beyond-Planarity},
journal = {CoRR},
volume = {abs/1908.03042},
year = {2019},
url = {http://arxiv.org/abs/1908.03042},
eprinttype = {arXiv},
eprint = {1908.03042},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-03042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-08708,
author = {Patrizio Angelini and
Henry F{\"{o}}rster and
Michael Hoffmann and
Michael Kaufmann and
Stephen G. Kobourov and
Giuseppe Liotta and
Maurizio Patrignani},
title = {The QuaSEFE Problem},
journal = {CoRR},
volume = {abs/1908.08708},
year = {2019},
url = {http://arxiv.org/abs/1908.08708},
eprinttype = {arXiv},
eprint = {1908.08708},
timestamp = {Tue, 27 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-08708.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10863,
author = {Michael A. Bekos and
Carla Binucci and
Michael Kaufmann and
Chrysanthi N. Raftopoulou and
Antonios Symvonis and
Alessandra Tappini},
title = {Coloring outerplanar graphs and planar 3-trees with small monochromatic
components},
journal = {CoRR},
volume = {abs/1911.10863},
year = {2019},
url = {http://arxiv.org/abs/1911.10863},
eprinttype = {arXiv},
eprint = {1911.10863},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10863.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/Hong0PT19,
author = {Seok{-}Hee Hong and
Michael Kaufmann and
J{\'{a}}nos Pach and
Csaba D. T{\'{o}}th},
title = {Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl
Seminar 19092)},
journal = {Dagstuhl Reports},
volume = {9},
number = {2},
pages = {123--156},
year = {2019},
url = {https://doi.org/10.4230/DagRep.9.2.123},
doi = {10.4230/DAGREP.9.2.123},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/Hong0PT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BruckdorferF018,
author = {Till Bruckdorfer and
Stefan Felsner and
Michael Kaufmann},
title = {Planar Bus Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2260--2285},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0321-5},
doi = {10.1007/S00453-017-0321-5},
timestamp = {Fri, 11 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BruckdorferF018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EvansFKKMNV18,
author = {William S. Evans and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Debajyoti Mondal and
Rahnuma Islam Nishat and
Kevin Verbeek},
title = {Table cartogram},
journal = {Comput. Geom.},
volume = {68},
pages = {174--185},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.06.010},
doi = {10.1016/J.COMGEO.2017.06.010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/EvansFKKMNV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AngeliniBBKMRS18,
author = {Patrizio Angelini and
Till Bruckdorfer and
Giuseppe Di Battista and
Michael Kaufmann and
Tamara Mchedlidze and
Vincenzo Roselli and
Claudio Squarcella},
title = {Small Universal Point Sets for k-Outerplanar Graphs},
journal = {Discret. Comput. Geom.},
volume = {60},
number = {2},
pages = {430--470},
year = {2018},
url = {https://doi.org/10.1007/s00454-018-0009-x},
doi = {10.1007/S00454-018-0009-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AngeliniBBKMRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKM18,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {Guest Editors' Foreword and Overview},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {1--10},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00459},
doi = {10.7155/JGAA.00459},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngeliniBKKS18,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Thomas Schneck},
title = {1-Fan-bundle-planar drawings of graphs},
journal = {Theor. Comput. Sci.},
volume = {723},
pages = {23--50},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.03.005},
doi = {10.1016/J.TCS.2018.03.005},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngeliniBKKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BekosBFKPS18,
author = {Michael A. Bekos and
Till Bruckdorfer and
Henry F{\"{o}}rster and
Michael Kaufmann and
Simon Poschenrieder and
Thomas St{\"{u}}ber},
title = {Algorithms and insights for RaceTrack},
journal = {Theor. Comput. Sci.},
volume = {748},
pages = {2--16},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.04.028},
doi = {10.1016/J.TCS.2018.04.028},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BekosBFKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/0001KLMRV18,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
editor = {B. S. Panda and
Partha P. Goswami},
title = {Bounded Stub Resolution for Some Maximal 1-Planar Graphs},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {214--220},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_18},
doi = {10.1007/978-3-319-74180-2\_18},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/0001KLMRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniBF018,
author = {Patrizio Angelini and
Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
editor = {Therese Biedl and
Andreas Kerren},
title = {On {RAC} Drawings of Graphs with One Bend per Edge},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {123--136},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_9},
doi = {10.1007/978-3-030-04414-5\_9},
timestamp = {Sun, 13 Nov 2022 09:57:25 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniBF018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlamBG0P18,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
editor = {Therese Biedl and
Andreas Kerren},
title = {Queue Layouts of Planar 3-Trees},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {213--226},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_15},
doi = {10.1007/978-3-030-04414-5\_15},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlamBG0P18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/0001PTU18,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
editor = {Therese Biedl and
Andreas Kerren},
title = {The Number of Crossings in Multigraphs with No Empty Lens},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {242--254},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_17},
doi = {10.1007/978-3-030-04414-5\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/0001PTU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosFGH0SS18,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Christian Geckeler and
Lukas Holl{\"{a}}nder and
Michael Kaufmann and
Amad{\"{a}}us M. Spallek and
Jan Splett},
editor = {Therese Biedl and
Andreas Kerren},
title = {A Heuristic Approach Towards Drawings of Graphs with High Crossing
Resolution},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {271--285},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_19},
doi = {10.1007/978-3-030-04414-5\_19},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosFGH0SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ArgyriouCF0NORW18,
author = {Evmorfia N. Argyriou and
Sabine Cornelsen and
Henry F{\"{o}}rster and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Chrysanthi N. Raftopoulou and
Alexander Wolff},
editor = {Therese Biedl and
Andreas Kerren},
title = {Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low
Edge Complexity},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {509--523},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_36},
doi = {10.1007/978-3-030-04414-5\_36},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/ArgyriouCF0NORW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AngeliniB0PU18,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Beyond-Planarity: Tur{\'{a}}n-Type Results for Non-Planar Bipartite
Graphs},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {28:1--28:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.28},
doi = {10.4230/LIPICS.ISAAC.2018.28},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AngeliniB0PU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AlamBG0P18,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {On Dispersable Book Embeddings},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {1--14},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_1},
doi = {10.1007/978-3-030-00256-5\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AlamBG0P18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10030,
author = {Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {On Dispersable Book Embeddings},
journal = {CoRR},
volume = {abs/1803.10030},
year = {2018},
url = {http://arxiv.org/abs/1803.10030},
eprinttype = {arXiv},
eprint = {1803.10030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10470,
author = {Patrizio Angelini and
Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
title = {On {RAC} Drawings of Graphs with one Bend per Edge},
journal = {CoRR},
volume = {abs/1808.10470},
year = {2018},
url = {http://arxiv.org/abs/1808.10470},
eprinttype = {arXiv},
eprint = {1808.10470},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10470.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10480,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
title = {The number of crossings in multigraphs with no empty lens},
journal = {CoRR},
volume = {abs/1808.10480},
year = {2018},
url = {http://arxiv.org/abs/1808.10480},
eprinttype = {arXiv},
eprint = {1808.10480},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10519,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Christian Geckeler and
Lukas Holl{\"{a}}nder and
Michael Kaufmann and
Amad{\"{a}}us M. Spallek and
Jan Splett},
title = {A Heuristic Approach towards Drawings of Graphs with High Crossing
Resolution},
journal = {CoRR},
volume = {abs/1808.10519},
year = {2018},
url = {http://arxiv.org/abs/1808.10519},
eprinttype = {arXiv},
eprint = {1808.10519},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10519.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10536,
author = {Evmorfia N. Argyriou and
Sabine Cornelsen and
Henry F{\"{o}}rster and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Chrysanthi N. Raftopoulou and
Alexander Wolff},
title = {Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low
Edge Complexity},
journal = {CoRR},
volume = {abs/1808.10536},
year = {2018},
url = {http://arxiv.org/abs/1808.10536},
eprinttype = {arXiv},
eprint = {1808.10536},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10841,
author = {Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev},
title = {Queue Layouts of Planar 3-Trees},
journal = {CoRR},
volume = {abs/1808.10841},
year = {2018},
url = {http://arxiv.org/abs/1808.10841},
eprinttype = {arXiv},
eprint = {1808.10841},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosCGHK17,
author = {Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok{-}Hee Hong and
Michael Kaufmann},
title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {401--427},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0200-5},
doi = {10.1007/S00453-016-0200-5},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosCGHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosBKR17,
author = {Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {The Book Thickness of 1-Planar Graphs is Constant},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {444--465},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0203-2},
doi = {10.1007/S00453-016-0203-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosBKR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlamCFKKPT17,
author = {Md. Jawaherul Alam and
Steven Chaplick and
Gasper Fijavz and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Jackson Toeniskoetter},
title = {Threshold-coloring and unit-cube contact representation of planar
graphs},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {2--14},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.09.003},
doi = {10.1016/J.DAM.2015.09.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlamCFKKPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BekosKKSV17,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Konstantinos S. Stavropoulos and
Sankar Veeramoni},
title = {The maximum k-differential coloring problem},
journal = {J. Discrete Algorithms},
volume = {45},
pages = {35--53},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.08.001},
doi = {10.1016/J.JDA.2017.08.001},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BekosKKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniBLD0KMR17,
author = {Patrizio Angelini and
Michael A. Bekos and
Felice De Luca and
Walter Didimo and
Michael Kaufmann and
Stephen G. Kobourov and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Vincenzo Roselli and
Antonios Symvonis},
title = {Vertex-Coloring with Defects},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {313--340},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00418},
doi = {10.7155/JGAA.00418},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniBLD0KMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKK17,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
title = {On the Total Number of Bends for Planar Octilinear Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {709--730},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00436},
doi = {10.7155/JGAA.00436},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BruckdorferCGKM17,
author = {Till Bruckdorfer and
Sabine Cornelsen and
Carsten Gutwenger and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Alexander Wolff},
title = {Progress on Partial Edge Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {757--786},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00438},
doi = {10.7155/JGAA.00438},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BruckdorferCGKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/GeyerHKKT17,
author = {Markus Geyer and
Michael Hoffmann and
Michael Kaufmann and
Vincent Kusters and
Csaba D. T{\'{o}}th},
title = {The planar tree packing theorem},
journal = {J. Comput. Geom.},
volume = {8},
number = {2},
pages = {109--177},
year = {2017},
url = {https://doi.org/10.20382/jocg.v8i2a6},
doi = {10.20382/JOCG.V8I2A6},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/GeyerHKKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Bekos0R17,
author = {Michael A. Bekos and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
editor = {Boris Aronov and
Matthew J. Katz},
title = {On Optimal 2- and 3-Planar Graphs},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {16:1--16:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.16},
doi = {10.4230/LIPICS.SOCG.2017.16},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Bekos0R17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniCL0HH0K17,
author = {Patrizio Angelini and
Steven Chaplick and
Felice De Luca and
Jir{\'{\i}} Fiala and
Jaroslav Hancl Jr. and
Niklas Heinsohn and
Michael Kaufmann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Pavel Valtr},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {On Vertex- and Empty-Ply Proximity Drawings},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {24--37},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_3},
doi = {10.1007/978-3-319-73915-1\_3},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniCL0HH0K17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Heinsohn017,
author = {Niklas Heinsohn and
Michael Kaufmann},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {An Interactive Tool to Explore and Improve the Ply Number of Drawings},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {38--51},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_4},
doi = {10.1007/978-3-319-73915-1\_4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Heinsohn017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniB0M17,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {3D Visibility Representations of 1-planar Graphs},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {102--109},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_9},
doi = {10.1007/978-3-319-73915-1\_9},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniB0M17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosF017,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity
and Kandinsky Drawings},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {169--183},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_15},
doi = {10.1007/978-3-319-73915-1\_15},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosF017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniB0KS17,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Thomas Schneck},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {1-Fan-Bundle-Planar Drawings of Graphs},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {517--530},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_40},
doi = {10.1007/978-3-319-73915-1\_40},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniB0KS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniB0KS17,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Thomas Schneck},
title = {1-Fan-Bundle-Planar Drawings of Graphs},
journal = {CoRR},
volume = {abs/1702.06163},
year = {2017},
url = {http://arxiv.org/abs/1702.06163},
eprinttype = {arXiv},
eprint = {1702.06163},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngeliniB0KS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bekos0R17,
author = {Michael A. Bekos and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {On Optimal 2- and 3-Planar Graphs},
journal = {CoRR},
volume = {abs/1703.06526},
year = {2017},
url = {http://arxiv.org/abs/1703.06526},
eprinttype = {arXiv},
eprint = {1703.06526},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bekos0R17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06196,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {3D Visibility Representations of 1-planar Graphs},
journal = {CoRR},
volume = {abs/1708.06196},
year = {2017},
url = {http://arxiv.org/abs/1708.06196},
eprinttype = {arXiv},
eprint = {1708.06196},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06196.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09197,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Michael Kaufmann},
title = {On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity
and Kandinsky Drawings},
journal = {CoRR},
volume = {abs/1708.09197},
year = {2017},
url = {http://arxiv.org/abs/1708.09197},
eprinttype = {arXiv},
eprint = {1708.09197},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09233,
author = {Patrizio Angelini and
Steven Chaplick and
Felice De Luca and
Jir{\'{\i}} Fiala and
Jan Hancl Jr. and
Niklas Heinsohn and
Michael Kaufmann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Pavel Valtr},
title = {On Vertex- and Empty-Ply Proximity Drawings},
journal = {CoRR},
volume = {abs/1708.09233},
year = {2017},
url = {http://arxiv.org/abs/1708.09233},
eprinttype = {arXiv},
eprint = {1708.09233},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09250,
author = {Niklas Heinsohn and
Michael Kaufmann},
title = {An Interactive Tool to Explore and Improve the Ply Number of Drawings},
journal = {CoRR},
volume = {abs/1708.09250},
year = {2017},
url = {http://arxiv.org/abs/1708.09250},
eprinttype = {arXiv},
eprint = {1708.09250},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09250.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-09855,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
title = {Beyond-Planarity: Density Results for Bipartite Graphs},
journal = {CoRR},
volume = {abs/1712.09855},
year = {2017},
url = {http://arxiv.org/abs/1712.09855},
eprinttype = {arXiv},
eprint = {1712.09855},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-09855.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/StockelKTSBLGKG16,
author = {Daniel St{\"{o}}ckel and
Tim Kehl and
Patrick Trampert and
Lara Schneider and
Christina Backes and
Nicole Ludwig and
Andreas Gerasch and
Michael Kaufmann and
Manfred Gessler and
Norbert M. Graf and
Eckart Meese and
Andreas Keller and
Hans{-}Peter Lenhof},
title = {Multi-omics enrichment analysis using the GeneTrail2 web service},
journal = {Bioinform.},
volume = {32},
number = {10},
pages = {1502--1508},
year = {2016},
url = {https://doi.org/10.1093/bioinformatics/btv770},
doi = {10.1093/BIOINFORMATICS/BTV770},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/StockelKTSBLGKG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GeyerH0KT16,
author = {Markus Geyer and
Michael Hoffmann and
Michael Kaufmann and
Vincent Kusters and
Csaba D. T{\'{o}}th},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {The Planar Tree Packing Theorem},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {41:1--41:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.41},
doi = {10.4230/LIPICS.SOCG.2016.41},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GeyerH0KT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BekosBF0PS16,
author = {Michael A. Bekos and
Till Bruckdorfer and
Henry F{\"{o}}rster and
Michael Kaufmann and
Simon Poschenrieder and
Thomas St{\"{u}}ber},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {Algorithms and Insights for RaceTrack},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {6:1--6:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.6},
doi = {10.4230/LIPICS.FUN.2016.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fun/BekosBF0PS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniBBH0KSV16,
author = {Patrizio Angelini and
Michael A. Bekos and
Till Bruckdorfer and
Jaroslav Hancl Jr. and
Michael Kaufmann and
Stephen G. Kobourov and
Antonios Symvonis and
Pavel Valtr},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Low Ply Drawings of Trees},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {236--248},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_19},
doi = {10.1007/978-3-319-50106-2\_19},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniBBH0KSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Bekos0R16,
author = {Michael A. Bekos and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {On the Density of Non-simple 3-Planar Graphs},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {344--356},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_27},
doi = {10.1007/978-3-319-50106-2\_27},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Bekos0R16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/BekosKR16,
author = {Michael A. Bekos and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou and
Despina Kavraki},
title = {{AVDTC} of generalized 3-Halin graphs},
booktitle = {7th International Conference on Information, Intelligence, Systems
{\&} Applications, {IISA} 2016, Chalkidiki, Greece, July 13-15,
2016},
pages = {1--6},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/IISA.2016.7785421},
doi = {10.1109/IISA.2016.7785421},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iisa/BekosKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Bekos0016,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {On the Total Number of Bends for Planar Octilinear Drawings},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {152--163},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_12},
doi = {10.1007/978-3-662-49529-2\_12},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/Bekos0016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Alam0K16,
author = {Muhammad Jawaherul Alam and
Michael Kaufmann and
Stephen G. Kobourov},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {On Contact Graphs with Cubes and Proportional Boxes},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {107--120},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_9},
doi = {10.1007/978-3-662-49192-8\_9},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Alam0K16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AngeliniB0R16,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Vincenzo Roselli},
editor = {Mohammad Kaykobad and
Rossella Petreschi},
title = {Vertex-Coloring with Star-Defects},
booktitle = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
{WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9627},
pages = {40--51},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30139-6\_4},
doi = {10.1007/978-3-319-30139-6\_4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AngeliniB0R16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bekos0R16,
author = {Michael A. Bekos and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {On the Density of 3-Planar Graphs},
journal = {CoRR},
volume = {abs/1602.04995},
year = {2016},
url = {http://arxiv.org/abs/1602.04995},
eprinttype = {arXiv},
eprint = {1602.04995},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bekos0R16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeyerH0KT16,
author = {Markus Geyer and
Michael Hoffmann and
Michael Kaufmann and
Vincent Kusters and
Csaba D. T{\'{o}}th},
title = {The Planar Tree Packing Theorem},
journal = {CoRR},
volume = {abs/1603.07737},
year = {2016},
url = {http://arxiv.org/abs/1603.07737},
eprinttype = {arXiv},
eprint = {1603.07737},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeyerH0KT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniBBH0KSV16,
author = {Patrizio Angelini and
Michael A. Bekos and
Till Bruckdorfer and
Jaroslav Hancl and
Michael Kaufmann and
Stephen G. Kobourov and
Antonios Symvonis and
Pavel Valtr},
title = {Low Ply Drawings of Trees},
journal = {CoRR},
volume = {abs/1608.08538},
year = {2016},
url = {http://arxiv.org/abs/1608.08538},
eprinttype = {arXiv},
eprint = {1608.08538},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AngeliniBBH0KSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/Hong0KP16,
author = {Seok{-}Hee Hong and
Michael Kaufmann and
Stephen G. Kobourov and
J{\'{a}}nos Pach},
title = {Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar
16452)},
journal = {Dagstuhl Reports},
volume = {6},
number = {11},
pages = {35--62},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.11.35},
doi = {10.4230/DAGREP.6.11.35},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/Hong0KP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasG0KSW15,
author = {Aparna Das and
Emden R. Gansner and
Michael Kaufmann and
Stephen G. Kobourov and
Joachim Spoerhase and
Alexander Wolff},
title = {Approximating Minimum Manhattan Networks in Higher Dimensions},
journal = {Algorithmica},
volume = {71},
number = {1},
pages = {36--52},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9778-z},
doi = {10.1007/S00453-013-9778-Z},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasG0KSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/it/GeraschKNS0KL15,
author = {Andreas Gerasch and
Jan K{\"{u}}ntzer and
Peter Niermann and
Daniel St{\"{o}}ckel and
Michael Kaufmann and
Oliver Kohlbacher and
Hans{-}Peter Lenhof},
title = {Network-based interactive navigation and analysis of large biological
datasets},
journal = {it Inf. Technol.},
volume = {57},
number = {1},
pages = {37--48},
year = {2015},
url = {https://doi.org/10.1515/itit-2014-1076},
doi = {10.1515/ITIT-2014-1076},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/it/GeraschKNS0KL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Alam0KM15,
author = {Md. Jawaherul Alam and
Michael Kaufmann and
Stephen G. Kobourov and
Tamara Mchedlidze},
title = {Fitting Planar Graphs on Planar Maps},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {413--440},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00367},
doi = {10.7155/JGAA.00367},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Alam0KM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosG0015,
author = {Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Robert Krug},
title = {Planar Octilinear Drawings with One Bend Per Edge},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {657--680},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00369},
doi = {10.7155/JGAA.00369},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosG0015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosCFH0NRS15,
author = {Michael A. Bekos and
Sabine Cornelsen and
Martin Fink and
Seok{-}Hee Hong and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Ignaz Rutter and
Antonios Symvonis},
title = {Many-to-One Boundary Labeling with Backbones},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {3},
pages = {779--816},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00379},
doi = {10.7155/JGAA.00379},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BekosCFH0NRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BekosB0R15,
author = {Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {1-Planar Graphs have Constant Book Thickness},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {130--141},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_12},
doi = {10.1007/978-3-662-48350-3\_12},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/BekosB0R15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Bekos0Z15,
author = {Michael A. Bekos and
Michael Kaufmann and
Christian Zielke},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {The Book Embedding Problem from a SAT-Solving Perspective},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {125--138},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_11},
doi = {10.1007/978-3-319-27261-0\_11},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/Bekos0Z15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Bruckdorfer0KP15,
author = {Till Bruckdorfer and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {On Embeddability of Buses in Point Sets},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {395--408},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_33},
doi = {10.1007/978-3-319-27261-0\_33},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Bruckdorfer0KP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniB0M15,
author = {Patrizio Angelini and
Till Bruckdorfer and
Michael Kaufmann and
Tamara Mchedlidze},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {A Universal Point Set for 2-Outerplanar Graphs},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {409--422},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_34},
doi = {10.1007/978-3-319-27261-0\_34},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniB0M15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Bruckdorfer0L15,
author = {Till Bruckdorfer and
Michael Kaufmann and
Simon Leib{\ss}le},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {{PED} User Study},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {551--553},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_47},
doi = {10.1007/978-3-319-27261-0\_47},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Bruckdorfer0L15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/Bekos0015,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou},
title = {Sloginsky drawings of graphs},
booktitle = {6th International Conference on Information, Intelligence, Systems
and Applications, {IISA} 2015, Corfu, Greece, July 6-8, 2015},
pages = {1--6},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/IISA.2015.7388121},
doi = {10.1109/IISA.2015.7388121},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/iisa/Bekos0015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/Bruckdorfer0L15,
author = {Till Bruckdorfer and
Michael Kaufmann and
Andreas Lauer},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou},
title = {A practical approach for 1/4-SHPEDs},
booktitle = {6th International Conference on Information, Intelligence, Systems
and Applications, {IISA} 2015, Corfu, Greece, July 6-8, 2015},
pages = {1--6},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/IISA.2015.7387994},
doi = {10.1109/IISA.2015.7387994},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iisa/Bruckdorfer0L15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/GiacomoDH0KLMSY15,
author = {Emilio Di Giacomo and
Walter Didimo and
Seok{-}Hee Hong and
Michael Kaufmann and
Stephen G. Kobourov and
Giuseppe Liotta and
Kazuo Misue and
Antonios Symvonis and
Hsu{-}Chun Yen},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou},
title = {Low ply graph drawing},
booktitle = {6th International Conference on Information, Intelligence, Systems
and Applications, {IISA} 2015, Corfu, Greece, July 6-8, 2015},
pages = {1--6},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/IISA.2015.7388020},
doi = {10.1109/IISA.2015.7388020},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iisa/GiacomoDH0KLMSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Zielke015,
author = {Christian Zielke and
Michael Kaufmann},
editor = {Marijn Heule and
Sean A. Weaver},
title = {A New Approach to Partial {MUS} Enumeration},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th
International Conference, Austin, TX, USA, September 24-27, 2015,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9340},
pages = {387--404},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24318-4\_28},
doi = {10.1007/978-3-319-24318-4\_28},
timestamp = {Tue, 21 May 2019 09:04:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/Zielke015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Bekos0KV15,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Sankar Veeramoni},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {The Maximum k-Differential Coloring Problem},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {115--127},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_10},
doi = {10.1007/978-3-662-46078-8\_10},
timestamp = {Sun, 02 Jun 2019 21:12:07 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Bekos0KV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Contact Graphs of Circular Arcs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {1--13},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_1},
doi = {10.1007/978-3-319-21840-3\_1},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BrandenburgH0N15,
author = {Franz J. Brandenburg and
Niklas Heinsohn and
Michael Kaufmann and
Daniel Neuwirth},
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {On Bar (1, j)-Visibility Graphs - (Extended Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
pages = {246--257},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5\_22},
doi = {10.1007/978-3-319-15612-5\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BrandenburgH0N15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/Bekos00S15,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug and
Martin Siebenhaller},
editor = {Evripidis Bampis},
title = {The Effect of Almost-Empty Faces on Planar Kandinsky Drawings},
booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015,
Paris, France, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9125},
pages = {352--364},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20086-6\_27},
doi = {10.1007/978-3-319-20086-6\_27},
timestamp = {Thu, 23 Sep 2021 11:47:32 +0200},
biburl = {https://dblp.org/rec/conf/wea/Bekos00S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
title = {Contact Representations of Sparse Planar Graphs},
journal = {CoRR},
volume = {abs/1501.00318},
year = {2015},
url = {http://arxiv.org/abs/1501.00318},
eprinttype = {arXiv},
eprint = {1501.00318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BekosB0R15,
author = {Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {The Book Thickness of 1-Planar Graphs is Constant},
journal = {CoRR},
volume = {abs/1503.04990},
year = {2015},
url = {http://arxiv.org/abs/1503.04990},
eprinttype = {arXiv},
eprint = {1503.04990},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BekosB0R15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniB0M15,
author = {Patrizio Angelini and
Till Bruckdorfer and
Michael Kaufmann and
Tamara Mchedlidze},
title = {A Universal Point Set for 2-Outerplanar Graphs},
journal = {CoRR},
volume = {abs/1508.05784},
year = {2015},
url = {http://arxiv.org/abs/1508.05784},
eprinttype = {arXiv},
eprint = {1508.05784},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngeliniB0M15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bruckdorfer0KP15,
author = {Till Bruckdorfer and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev},
title = {On Embeddability of Buses in Point Sets},
journal = {CoRR},
volume = {abs/1508.06760},
year = {2015},
url = {http://arxiv.org/abs/1508.06760},
eprinttype = {arXiv},
eprint = {1508.06760},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bruckdorfer0KP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Alam0K15,
author = {Md. Jawaherul Alam and
Michael Kaufmann and
Stephen G. Kobourov},
title = {On Contact Graphs with Cubes and Proportional Boxes},
journal = {CoRR},
volume = {abs/1510.02484},
year = {2015},
url = {http://arxiv.org/abs/1510.02484},
eprinttype = {arXiv},
eprint = {1510.02484},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Alam0K15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniB0R15,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Vincenzo Roselli},
title = {Vertex-Coloring with Star-Defects},
journal = {CoRR},
volume = {abs/1512.02505},
year = {2015},
url = {http://arxiv.org/abs/1512.02505},
eprinttype = {arXiv},
eprint = {1512.02505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngeliniB0R15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bekos0015,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
title = {On the Total Number of Bends for Planar Octilinear Drawings},
journal = {CoRR},
volume = {abs/1512.04866},
year = {2015},
url = {http://arxiv.org/abs/1512.04866},
eprinttype = {arXiv},
eprint = {1512.04866},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bekos0015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AngeliniBCFKS14,
author = {Patrizio Angelini and
Till Bruckdorfer and
Marco Chiesa and
Fabrizio Frati and
Michael Kaufmann and
Claudio Squarcella},
title = {On the area requirements of Euclidean minimum spanning trees},
journal = {Comput. Geom.},
volume = {47},
number = {2},
pages = {200--213},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2012.10.011},
doi = {10.1016/J.COMGEO.2012.10.011},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AngeliniBCFKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/FelsnerKV14,
author = {Stefan Felsner and
Michael Kaufmann and
Pavel Valtr},
title = {Bend-optimal orthogonal graph drawing in the general position model},
journal = {Comput. Geom.},
volume = {47},
number = {3},
pages = {460--468},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.03.002},
doi = {10.1016/J.COMGEO.2013.03.002},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/FelsnerKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BekosKKV14,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Sankar Veeramoni},
title = {A note on maximum differential coloring of planar graphs},
journal = {J. Discrete Algorithms},
volume = {29},
pages = {1--7},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.06.004},
doi = {10.1016/J.JDA.2014.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BekosKKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BruckdorferKM14,
author = {Till Bruckdorfer and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {1-Bend Orthogonal Partial Edge Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {111--131},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00316},
doi = {10.7155/JGAA.00316},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BruckdorferKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiKPTW14,
author = {Fabrizio Frati and
Michael Kaufmann and
J{\'{a}}nos Pach and
Csaba D. T{\'{o}}th and
David R. Wood},
title = {On the Upward Planarity of Mixed Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {253--279},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00322},
doi = {10.7155/JGAA.00322},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiKPTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniEFKLMTW14,
author = {Patrizio Angelini and
David Eppstein and
Fabrizio Frati and
Michael Kaufmann and
Sylvain Lazard and
Tamara Mchedlidze and
Monique Teillaud and
Alexander Wolff},
title = {Universal Point Sets for Drawing Planar Graphs with Circular Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {313--324},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00324},
doi = {10.7155/JGAA.00324},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniEFKLMTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bekos0KLNR14,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug and
Thorsten Ludwig and
Stefan N{\"{a}}her and
Vincenzo Roselli},
title = {Slanted Orthogonal Drawings: Model, Algorithms and Evaluations},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {459--489},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00332},
doi = {10.7155/JGAA.00332},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Bekos0KLNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Evans0LMW14,
author = {William S. Evans and
Michael Kaufmann and
William J. Lenhart and
Tamara Mchedlidze and
Stephen K. Wismath},
title = {Bar 1-Visibility Graphs vs. other Nearly Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {5},
pages = {721--739},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00343},
doi = {10.7155/JGAA.00343},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Evans0LMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/GeraschKK14,
author = {Andreas Gerasch and
Michael Kaufmann and
Oliver Kohlbacher},
editor = {Issei Fujishiro and
Ulrik Brandes and
Hans Hagen and
Shigeo Takahashi},
title = {Rebuilding {KEGG} Maps: Algorithms and Benefits},
booktitle = {{IEEE} Pacific Visualization Symposium, PacificVis 2014, Yokohama,
Japan, March 4-7, 2014},
pages = {97--104},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/PacificVis.2014.45},
doi = {10.1109/PACIFICVIS.2014.45},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/apvis/GeraschKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/HeinsohnGK14,
author = {Niklas Heinsohn and
Andreas Gerasch and
Michael Kaufmann},
editor = {Issei Fujishiro and
Ulrik Brandes and
Hans Hagen and
Shigeo Takahashi},
title = {Boundary Labeling Methods for Dynamic Focus Regions},
booktitle = {{IEEE} Pacific Visualization Symposium, PacificVis 2014, Yokohama,
Japan, March 4-7, 2014},
pages = {243--247},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/PacificVis.2014.20},
doi = {10.1109/PACIFICVIS.2014.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/apvis/HeinsohnGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosCGHK14,
author = {Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok{-}Hee Hong and
Michael Kaufmann},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {198--209},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_17},
doi = {10.1007/978-3-662-45803-7\_17},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/BekosCGHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosGKK14,
author = {Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Robert Krug},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Planar Octilinear Drawings with One Bend Per Edge},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {331--342},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_28},
doi = {10.1007/978-3-662-45803-7\_28},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosGKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/BekosKK14,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou},
title = {Sloggy drawings of graphs},
booktitle = {5th International Conference on Information, Intelligence, Systems
and Applications, {IISA} 2014, Chania, Crete, Greece, July 7-9, 2014},
pages = {82--87},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/IISA.2014.6878764},
doi = {10.1109/IISA.2014.6878764},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/iisa/BekosKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iisa/GiacomoDKLM14,
author = {Emilio Di Giacomo and
Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Fabrizio Montecchiani},
editor = {Nikolaos G. Bourbakis and
George A. Tsihrintzis and
Maria Virvou},
title = {Upward-rightward planar drawings},
booktitle = {5th International Conference on Information, Intelligence, Systems
and Applications, {IISA} 2014, Chania, Crete, Greece, July 7-9, 2014},
pages = {145--150},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/IISA.2014.6878792},
doi = {10.1109/IISA.2014.6878792},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iisa/GiacomoDKLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AlamBKKKW14,
author = {Muhammad Jawaherul Alam and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Stephen G. Kobourov and
Alexander Wolff},
editor = {Alberto Pardo and
Alfredo Viola},
title = {Smooth Orthogonal Drawings of Planar Graphs},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {144--155},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_13},
doi = {10.1007/978-3-642-54423-1\_13},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/AlamBKKKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AlamKKM14,
author = {Md. Jawaherul Alam and
Michael Kaufmann and
Stephen G. Kobourov and
Tamara Mchedlidze},
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {Fitting Planar Graphs on Planar Maps},
booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
pages = {52--64},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5\_6},
doi = {10.1007/978-3-319-04298-5\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/AlamKKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaufmannU14,
author = {Michael Kaufmann and
Torsten Ueckerdt},
title = {The Density of Fan-Planar Graphs},
journal = {CoRR},
volume = {abs/1403.6184},
year = {2014},
url = {http://arxiv.org/abs/1403.6184},
eprinttype = {arXiv},
eprint = {1403.6184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KaufmannU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BekosGKK14,
author = {Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Robert Krug},
title = {Planar Octilinear Drawings with One Bend Per Edge},
journal = {CoRR},
volume = {abs/1408.5920},
year = {2014},
url = {http://arxiv.org/abs/1408.5920},
eprinttype = {arXiv},
eprint = {1408.5920},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BekosGKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BekosCGHK14,
author = {Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok{-}Hee Hong and
Michael Kaufmann},
title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs},
journal = {CoRR},
volume = {abs/1409.0461},
year = {2014},
url = {http://arxiv.org/abs/1409.0461},
eprinttype = {arXiv},
eprint = {1409.0461},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BekosCGHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BekosKKV14,
author = {Michael A. Bekos and
Stephen G. Kobourov and
Michael Kaufmann and
Sankar Veeramoni},
title = {The Maximum k-Differential Coloring Problem},
journal = {CoRR},
volume = {abs/1409.8133},
year = {2014},
url = {http://arxiv.org/abs/1409.8133},
eprinttype = {arXiv},
eprint = {1409.8133},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BekosKKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlamBFGKK13,
author = {Muhammad Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Andreas Gerasch and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact
Graph Representations},
journal = {Algorithmica},
volume = {67},
number = {1},
pages = {3--22},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9764-5},
doi = {10.1007/S00453-013-9764-5},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlamBFGKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/StockelMKGBRKKL13,
author = {Daniel St{\"{o}}ckel and
Oliver M{\"{u}}ller and
Tim Kehl and
Andreas Gerasch and
Christina Backes and
Alexander Rurainski and
Andreas Keller and
Michael Kaufmann and
Hans{-}Peter Lenhof},
title = {NetworkTrail - a web service for identifying and visualizing deregulated
subnetworks},
journal = {Bioinform.},
volume = {29},
number = {13},
pages = {1702--1703},
year = {2013},
url = {https://doi.org/10.1093/bioinformatics/btt204},
doi = {10.1093/BIOINFORMATICS/BTT204},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/StockelMKGBRKKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EvansGKLMS13,
author = {William S. Evans and
Emden R. Gansner and
Michael Kaufmann and
Giuseppe Liotta and
Henk Meijer and
Andreas Spillner},
title = {Approximate proximity drawings},
journal = {Comput. Geom.},
volume = {46},
number = {6},
pages = {604--614},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2013.01.001},
doi = {10.1016/J.COMGEO.2013.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/EvansGKLMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KaufmannMS13,
author = {Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
title = {On upward point set embeddability},
journal = {Comput. Geom.},
volume = {46},
number = {6},
pages = {774--804},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2012.11.008},
doi = {10.1016/J.COMGEO.2012.11.008},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/KaufmannMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AlamBFKKU13,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
title = {Computing Cartograms with Optimal Complexity},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {3},
pages = {784--810},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9521-1},
doi = {10.1007/S00454-013-9521-1},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AlamBFKKU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgyriouBKS13,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {Geometric {RAC} Simultaneous Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {1},
pages = {11--34},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00282},
doi = {10.7155/JGAA.00282},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgyriouBKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKKS13,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Antonios Symvonis},
title = {Smooth Orthogonal Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {5},
pages = {575--595},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00305},
doi = {10.7155/JGAA.00305},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AngeliniEFKLMTW13,
author = {Patrizio Angelini and
David Eppstein and
Fabrizio Frati and
Michael Kaufmann and
Sylvain Lazard and
Tamara Mchedlidze and
Monique Teillaud and
Alexander Wolff},
title = {Universal Point Sets for Planar Graph Drawings with Circular Arcs},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_43.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AngeliniEFKLMTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BruckdorferFK13,
author = {Till Bruckdorfer and
Stefan Felsner and
Michael Kaufmann},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {On the Characterization of Plane Bus Graphs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {73--84},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_7},
doi = {10.1007/978-3-642-38233-8\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BruckdorferFK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EvansFKKMNV13,
author = {William S. Evans and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Debajyoti Mondal and
Rahnuma Islam Nishat and
Kevin Verbeek},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Table Cartograms},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {421--432},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_36},
doi = {10.1007/978-3-642-40450-4\_36},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/EvansFKKMNV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FratiKPTW13,
author = {Fabrizio Frati and
Michael Kaufmann and
J{\'{a}}nos Pach and
Csaba D. T{\'{o}}th and
David R. Wood},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {On the Upward Planarity of Mixed Plane Graphs},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {1--12},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_1},
doi = {10.1007/978-3-319-03841-4\_1},
timestamp = {Sun, 13 Nov 2022 09:57:27 +0100},
biburl = {https://dblp.org/rec/conf/gd/FratiKPTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosCFHKNRS13,
author = {Michael A. Bekos and
Sabine Cornelsen and
Martin Fink and
Seok{-}Hee Hong and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Ignaz Rutter and
Antonios Symvonis},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Many-to-One Boundary Labeling with Backbones},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {244--255},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_22},
doi = {10.1007/978-3-319-03841-4\_22},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/BekosCFHKNRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosKKNR13,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug and
Stefan N{\"{a}}her and
Vincenzo Roselli},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Slanted Orthogonal Drawings},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {424--435},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_37},
doi = {10.1007/978-3-319-03841-4\_37},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosKKNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/DellertZK13,
author = {Johannes Dellert and
Christian Zielke and
Michael Kaufmann},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {MUStICCa: {MUS} Extraction with Interactive Choice of Candidates},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {408--414},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_31},
doi = {10.1007/978-3-642-39071-5\_31},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/DellertZK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GeyerHKKT13,
author = {Markus Geyer and
Michael Hoffmann and
Michael Kaufmann and
Vincent Kusters and
Csaba D. T{\'{o}}th},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Planar Packing of Binary Trees},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {353--364},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_31},
doi = {10.1007/978-3-642-40104-6\_31},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/GeyerHKKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AlamCFKKP13,
author = {Md. Jawaherul Alam and
Steven Chaplick and
Gasper Fijavz and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Threshold-Coloring and Unit-Cube Contact Representation of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {26--37},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_4},
doi = {10.1007/978-3-642-45043-3\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AlamCFKKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6183,
author = {Md. Jawaherul Alam and
Gasper Fijavz and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev},
title = {Threshold Coloring and Unit-Cube Contact Representation of Graphs},
journal = {CoRR},
volume = {abs/1302.6183},
year = {2013},
url = {http://arxiv.org/abs/1302.6183},
eprinttype = {arXiv},
eprint = {1302.6183},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6183.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-7085,
author = {Aparna Das and
Markus Geyer and
Michael Kaufmann and
Stephen G. Kobourov and
Sankar Veeramoni},
title = {Maximum Differential Coloring of Caterpillars and Spiders},
journal = {CoRR},
volume = {abs/1302.7085},
year = {2013},
url = {http://arxiv.org/abs/1302.7085},
eprinttype = {arXiv},
eprint = {1302.7085},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-7085.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BekosCFHKNRS13,
author = {Michael A. Bekos and
Sabine Cornelsen and
Martin Fink and
Seok{-}Hee Hong and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Ignaz Rutter and
Antonios Symvonis},
title = {Many-to-One Boundary Labeling with Backbones},
journal = {CoRR},
volume = {abs/1308.6801},
year = {2013},
url = {http://arxiv.org/abs/1308.6801},
eprinttype = {arXiv},
eprint = {1308.6801},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BekosCFHKNRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamBKKKW13,
author = {Md. Jawaherul Alam and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Stephen G. Kobourov and
Alexander Wolff},
title = {Smooth Orthogonal Drawings of Planar Graphs},
journal = {CoRR},
volume = {abs/1312.3538},
year = {2013},
url = {http://arxiv.org/abs/1312.3538},
eprinttype = {arXiv},
eprint = {1312.3538},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamBKKKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EvansKLLMW13,
author = {William S. Evans and
Michael Kaufmann and
William J. Lenhart and
Giuseppe Liotta and
Tamara Mchedlidze and
Stephen K. Wismath},
title = {Bar 1-Visibility Graphs and their relation to other Nearly Planar
Graphs},
journal = {CoRR},
volume = {abs/1312.5520},
year = {2013},
url = {http://arxiv.org/abs/1312.5520},
eprinttype = {arXiv},
eprint = {1312.5520},
timestamp = {Tue, 20 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EvansKLLMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuncanGHKK12,
author = {Christian A. Duncan and
Emden R. Gansner and
Yifan Hu and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Optimal Polygonal Representation of Planar Graphs},
journal = {Algorithmica},
volume = {63},
number = {3},
pages = {672--691},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9525-2},
doi = {10.1007/S00453-011-9525-2},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DuncanGHKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/LacznyLHLBGKVKMSMLK12,
author = {Cedric Laczny and
Petra Leidinger and
Jan Haas and
Nicole Ludwig and
Christina Backes and
Andreas Gerasch and
Michael Kaufmann and
Britta Vogel and
Hugo A. Katus and
Benjamin Meder and
Cord St{\"{a}}hler and
Eckart Meese and
Hans{-}Peter Lenhof and
Andreas Keller},
title = {miRTrail - a comprehensive webserver for analyzing gene and miRNA
patterns to enhance the understanding of regulatory mechanisms in
diseases},
journal = {{BMC} Bioinform.},
volume = {13},
pages = {36},
year = {2012},
url = {https://doi.org/10.1186/1471-2105-13-36},
doi = {10.1186/1471-2105-13-36},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/LacznyLHLBGKVKMSMLK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DidimoKLOS12,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Yoshio Okamoto and
Andreas Spillner},
title = {Vertex angle and crossing angle resolution of leveled tree drawings},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {630--635},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.006},
doi = {10.1016/J.IPL.2012.05.006},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DidimoKLOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniGKN12,
author = {Patrizio Angelini and
Markus Geyer and
Michael Kaufmann and
Daniel Neuwirth},
title = {On a Tree and a Path with no Geometric Simultaneous Embedding},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {37--83},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00250},
doi = {10.7155/JGAA.00250},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniGKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AlamBFKK12,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Proportional Contact Representations of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {701--728},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00276},
doi = {10.7155/JGAA.00276},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AlamBFKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ArgyriouBKS12,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Geometric {RAC} Simultaneous Drawings of Graphs},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {287--298},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_25},
doi = {10.1007/978-3-642-32241-9\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ArgyriouBKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AlamBFKKU12,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Computing cartograms with optimal complexity},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {21--30},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261254},
doi = {10.1145/2261250.2261254},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AlamBFKKU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BruckdorferK12,
author = {Till Bruckdorfer and
Michael Kaufmann},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Mad at Edge Crossings? Break the Edges!},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {40--50},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_7},
doi = {10.1007/978-3-642-30347-0\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/BruckdorferK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BruckdorferCGKMNW12,
author = {Till Bruckdorfer and
Sabine Cornelsen and
Carsten Gutwenger and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Alexander Wolff},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {Progress on Partial Edge Drawings},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {67--78},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_7},
doi = {10.1007/978-3-642-36763-2\_7},
timestamp = {Sun, 13 Nov 2022 09:57:28 +0100},
biburl = {https://dblp.org/rec/conf/gd/BruckdorferCGKMNW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosKKS12,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Antonios Symvonis},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {Smooth Orthogonal Layouts},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {150--161},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_14},
doi = {10.1007/978-3-642-36763-2\_14},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosKKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerZSK12,
author = {Stephan Kottler and
Christian Zielke and
Paul Seitz and
Michael Kaufmann},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {CoPAn: Exploring Recurring Patterns in Conflict Analysis of {CDCL}
{SAT} Solvers - (Tool Presentation)},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {449--455},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_36},
doi = {10.1007/978-3-642-31612-8\_36},
timestamp = {Sun, 02 Jun 2019 21:24:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KottlerZSK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BurgKK12,
author = {Sebastian Burg and
Stephan Kottler and
Michael Kaufmann},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Creating Industrial-Like {SAT} Instances by Clustering and Reconstruction
- (Poster Presentation)},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {471--472},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_40},
doi = {10.1007/978-3-642-31612-8\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BurgKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-0066,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
title = {Computing Cartograms with Optimal Complexity},
journal = {CoRR},
volume = {abs/1201.0066},
year = {2012},
url = {http://arxiv.org/abs/1201.0066},
eprinttype = {arXiv},
eprint = {1201.0066},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-0066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-0830,
author = {Till Bruckdorfer and
Sabine Cornelsen and
Carsten Gutwenger and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Alexander Wolff},
title = {Progress on Partial Edge Drawings},
journal = {CoRR},
volume = {abs/1209.0830},
year = {2012},
url = {http://arxiv.org/abs/1209.0830},
eprinttype = {arXiv},
eprint = {1209.0830},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-0830.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandesEEFFGGHKKa11,
author = {Ulrik Brandes and
Cesim Erten and
Alejandro Estrella{-}Balderrama and
J. Joseph Fowler and
Fabrizio Frati and
Markus Geyer and
Carsten Gutwenger and
Seok{-}Hee Hong and
Michael Kaufmann and
Stephen G. Kobourov and
Giuseppe Liotta and
Petra Mutzel and
Antonios Symvonis},
title = {Colored Simultaneous Geometric Embeddings and Universal Pointsets},
journal = {Algorithmica},
volume = {60},
number = {3},
pages = {569--592},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9433-x},
doi = {10.1007/S00453-010-9433-X},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandesEEFFGGHKKa11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/FratiK11,
author = {Fabrizio Frati and
Michael Kaufmann},
title = {Polynomial area bounds for {MST} embeddings of trees},
journal = {Comput. Geom.},
volume = {44},
number = {9},
pages = {529--543},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2011.05.005},
doi = {10.1016/J.COMGEO.2011.05.005},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/FratiK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AngeliniFK11,
author = {Patrizio Angelini and
Fabrizio Frati and
Michael Kaufmann},
title = {Straight-Line Rectangular Drawings of Clustered Graphs},
journal = {Discret. Comput. Geom.},
volume = {45},
number = {1},
pages = {88--140},
year = {2011},
url = {https://doi.org/10.1007/s00454-010-9302-z},
doi = {10.1007/S00454-010-9302-Z},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AngeliniFK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniCDFBKS11,
author = {Patrizio Angelini and
Luca Cittadini and
Walter Didimo and
Fabrizio Frati and
Giuseppe Di Battista and
Michael Kaufmann and
Antonios Symvonis},
title = {On the Perspectives Opened by Right Angle Crossing Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {53--78},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00217},
doi = {10.7155/JGAA.00217},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniCDFBKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/snam/ZweigK11,
author = {Katharina Anna Zweig and
Michael Kaufmann},
title = {A systematic approach to the one-mode projection of bipartite graphs},
journal = {Soc. Netw. Anal. Min.},
volume = {1},
number = {3},
pages = {187--218},
year = {2011},
url = {https://doi.org/10.1007/s13278-011-0021-0},
doi = {10.1007/S13278-011-0021-0},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/snam/ZweigK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DasGKKSW11,
author = {Aparna Das and
Emden R. Gansner and
Michael Kaufmann and
Stephen G. Kobourov and
Joachim Spoerhase and
Alexander Wolff},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximating Minimum Manhattan Networks in Higher Dimensions},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {49--60},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_5},
doi = {10.1007/978-3-642-23719-5\_5},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DasGKKSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlamBFKK11,
author = {Muhammad Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Proportional Contact Representations of Planar Graphs},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {26--38},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_4},
doi = {10.1007/978-3-642-25878-7\_4},
timestamp = {Sun, 13 Nov 2022 09:57:29 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlamBFKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniBKMRS11,
author = {Patrizio Angelini and
Giuseppe Di Battista and
Michael Kaufmann and
Tamara Mchedlidze and
Vincenzo Roselli and
Claudio Squarcella},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Small Point Sets for Simply-Nested Planar Graphs},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {75--85},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_8},
doi = {10.1007/978-3-642-25878-7\_8},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniBKMRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EvansGKLMS11,
author = {William S. Evans and
Emden R. Gansner and
Michael Kaufmann and
Giuseppe Liotta and
Henk Meijer and
Andreas Spillner},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Approximate Proximity Drawings},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {166--178},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_17},
doi = {10.1007/978-3-642-25878-7\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/EvansGKLMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannMS11,
author = {Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Upward Point Set Embeddability for Convex Point Sets Is in {P}},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {403--414},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_38},
doi = {10.1007/978-3-642-25878-7\_38},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/KaufmannMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ArgyriouBKS11,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Combining Problems on {RAC} Drawings and Simultaneous Graph Drawings},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {433--434},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_41},
doi = {10.1007/978-3-642-25878-7\_41},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/ArgyriouBKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AlamBFGKK11,
author = {Muhammad Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Andreas Gerasch and
Michael Kaufmann and
Stephen G. Kobourov},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact
Graph Representations},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {281--291},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_30},
doi = {10.1007/978-3-642-25591-5\_30},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AlamBFGKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/s-egc/AngeliniBDFHKLL11,
author = {Patrizio Angelini and
Giuseppe Di Battista and
Walter Didimo and
Fabrizio Frati and
Seok{-}Hee Hong and
Michael Kaufmann and
Giuseppe Liotta and
Anna Lubiw},
editor = {Alberto M{\'{a}}rquez and
Pedro Ramos and
Jorge Urrutia},
title = {Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area},
booktitle = {Computational Geometry - {XIV} Spanish Meeting on Computational Geometry,
{EGC} 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th
Birthday, Alcal{\'{a}} de Henares, Spain, June 27-30, 2011, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7579},
pages = {200--209},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-34191-5\_19},
doi = {10.1007/978-3-642-34191-5\_19},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/s-egc/AngeliniBDFHKLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BekosKPS11,
author = {Michael A. Bekos and
Michael Kaufmann and
Dimitrios Papadopoulos and
Antonios Symvonis},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {Combining Traditional Map Labeling with Boundary Labeling},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {111--122},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_9},
doi = {10.1007/978-3-642-18381-2\_9},
timestamp = {Mon, 07 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BekosKPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GeyerKMS11,
author = {Markus Geyer and
Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {Upward Point-Set Embeddability},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {272--283},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_23},
doi = {10.1007/978-3-642-18381-2\_23},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GeyerKMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AngeliniBCFKS11,
author = {Patrizio Angelini and
Till Bruckdorfer and
Marco Chiesa and
Fabrizio Frati and
Michael Kaufmann and
Claudio Squarcella},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {On the Area Requirements of Euclidean Minimum Spanning Trees},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {25--36},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_3},
doi = {10.1007/978-3-642-22300-6\_3},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AngeliniBCFKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/KaufmannK11,
author = {Michael Kaufmann and
Stephan Kottler},
editor = {Panos M. Pardalos and
Steffen Rebennack},
title = {Beyond Unit Propagation in {SAT} Solving},
booktitle = {Experimental Algorithms - 10th International Symposium, {SEA} 2011,
Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6630},
pages = {267--279},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20662-7\_23},
doi = {10.1007/978-3-642-20662-7\_23},
timestamp = {Mon, 05 Feb 2024 20:31:36 +0100},
biburl = {https://dblp.org/rec/conf/wea/KaufmannK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-1482,
author = {Christian A. Duncan and
Emden R. Gansner and
Yifan Hu and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Optimal Polygonal Representation of Planar Graphs},
journal = {CoRR},
volume = {abs/1104.1482},
year = {2011},
url = {http://arxiv.org/abs/1104.1482},
eprinttype = {arXiv},
eprint = {1104.1482},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-1482.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-2694,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {Geometric Simultaneous {RAC} Drawings of Graphs},
journal = {CoRR},
volume = {abs/1106.2694},
year = {2011},
url = {http://arxiv.org/abs/1106.2694},
eprinttype = {arXiv},
eprint = {1106.2694},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-2694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-0901,
author = {Aparna Das and
Emden R. Gansner and
Michael Kaufmann and
Stephen G. Kobourov and
Joachim Spoerhase and
Alexander Wolff},
title = {Approximating Minimum Manhattan Networks in Higher Dimensions},
journal = {CoRR},
volume = {abs/1107.0901},
year = {2011},
url = {http://arxiv.org/abs/1107.0901},
eprinttype = {arXiv},
eprint = {1107.0901},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-0901.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-3092,
author = {Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
title = {Upward Point Set Embeddability for Convex Point Sets is in {\textdollar}P{\textdollar}},
journal = {CoRR},
volume = {abs/1108.3092},
year = {2011},
url = {http://arxiv.org/abs/1108.3092},
eprinttype = {arXiv},
eprint = {1108.3092},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-3092.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DemetrescuKKM11,
author = {Camil Demetrescu and
Michael Kaufmann and
Stephen G. Kobourov and
Petra Mutzel},
title = {Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar
11191)},
journal = {Dagstuhl Reports},
volume = {1},
number = {5},
pages = {47--60},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.5.47},
doi = {10.4230/DAGREP.1.5.47},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DemetrescuKKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosKNS10,
author = {Michael A. Bekos and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Antonios Symvonis},
title = {Boundary Labeling with Octilinear Leaders},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {436--461},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9283-6},
doi = {10.1007/S00453-009-9283-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosKNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/BekosKPS10,
author = {Michael A. Bekos and
Michael Kaufmann and
Katerina Potika and
Antonios Symvonis},
title = {Area-Feature Boundary Labeling},
journal = {Comput. J.},
volume = {53},
number = {6},
pages = {827--841},
year = {2010},
url = {https://doi.org/10.1093/comjnl/bxp087},
doi = {10.1093/COMJNL/BXP087},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/BekosKPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/insk/NieseltKGLSHG10,
author = {Kay Nieselt and
Michael Kaufmann and
Andreas Gerasch and
Hans{-}Peter Lenhof and
Marcel Spehr and
Stefan Hesse and
Stefan Gumhold},
title = {Visuelle Analytik biologischer Daten},
journal = {Inform. Spektrum},
volume = {33},
number = {6},
pages = {559--568},
year = {2010},
url = {https://doi.org/10.1007/s00287-010-0482-y},
doi = {10.1007/S00287-010-0482-Y},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/insk/NieseltKGLSHG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FernauKP10,
author = {Henning Fernau and
Michael Kaufmann and
Mathias Poths},
title = {Comparing trees via crossing minimization},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {7},
pages = {593--608},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.10.014},
doi = {10.1016/J.JCSS.2009.10.014},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FernauKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgyriouBKS10,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {On Metro-Line Crossing Minimization},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {75--96},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00199},
doi = {10.7155/JGAA.00199},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgyriouBKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniFGKMS10,
author = {Patrizio Angelini and
Fabrizio Frati and
Markus Geyer and
Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Upward Geometric Graph Embeddings into Point Sets},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {25--37},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_3},
doi = {10.1007/978-3-642-18469-7\_3},
timestamp = {Sun, 13 Nov 2022 09:57:29 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniFGKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniGKN10,
author = {Patrizio Angelini and
Markus Geyer and
Michael Kaufmann and
Daniel Neuwirth},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {On a Tree and a Path with No Geometric Simultaneous Embedding},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {38--49},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_4},
doi = {10.1007/978-3-642-18469-7\_4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniGKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/PupyrevNK10,
author = {Sergey Pupyrev and
Lev Nachmanson and
Michael Kaufmann},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Improving Layered Graph Layouts with Edge~Bundling},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {329--340},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_30},
doi = {10.1007/978-3-642-18469-7\_30},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/PupyrevNK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/GeyerKK10,
author = {Markus Geyer and
Michael Kaufmann and
Robert Krug},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Visualizing Differences between Two Large Graphs},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {393--394},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_38},
doi = {10.1007/978-3-642-18469-7\_38},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/GeyerKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GansnerHKK10,
author = {Emden R. Gansner and
Yifan Hu and
Michael Kaufmann and
Stephen G. Kobourov},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Optimal Polygonal Representation of Planar Graphs},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {417--432},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_37},
doi = {10.1007/978-3-642-12200-2\_37},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/GansnerHKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/softvis/AlbrechtEHK10,
author = {Benjamin Albrecht and
Philip Effinger and
Markus Held and
Michael Kaufmann},
editor = {Alexandru C. Telea and
Carsten G{\"{o}}rg and
Steven P. Reiss},
title = {An automatic layout algorithm for {BPEL} processes},
booktitle = {Proceedings of the {ACM} 2010 Symposium on Software Visualization,
Salt Lake City, UT, USA, October 25-26, 2010},
pages = {173--182},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1879211.1879237},
doi = {10.1145/1879211.1879237},
timestamp = {Wed, 17 Mar 2021 18:00:55 +0100},
biburl = {https://dblp.org/rec/conf/softvis/AlbrechtEHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0555,
author = {Patrizio Angelini and
Markus Geyer and
Michael Kaufmann and
Daniel Neuwirth},
title = {On a Tree and a Path with no Geometric Simultaneous Embedding},
journal = {CoRR},
volume = {abs/1001.0555},
year = {2010},
url = {http://arxiv.org/abs/1001.0555},
eprinttype = {arXiv},
eprint = {1001.0555},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0555.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-5937,
author = {Markus Geyer and
Michael Kaufmann and
Tamara Mchedlidze and
Antonios Symvonis},
title = {Upward Point-Set Embeddability},
journal = {CoRR},
volume = {abs/1010.5937},
year = {2010},
url = {http://arxiv.org/abs/1010.5937},
eprinttype = {arXiv},
eprint = {1010.5937},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-5937.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/KellerBGKKML09,
author = {Andreas Keller and
Christina Backes and
Andreas Gerasch and
Michael Kaufmann and
Oliver Kohlbacher and
Eckart Meese and
Hans{-}Peter Lenhof},
title = {A novel algorithm for detecting differentially regulated paths based
on gene set enrichment analysis},
journal = {Bioinform.},
volume = {25},
number = {21},
pages = {2787--2794},
year = {2009},
url = {https://doi.org/10.1093/bioinformatics/btp510},
doi = {10.1093/BIOINFORMATICS/BTP510},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/KellerBGKKML09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GeyerKV09,
author = {Markus Geyer and
Michael Kaufmann and
Imrich Vrto},
title = {Two trees which are self-intersecting when drawn simultaneously},
journal = {Discret. Math.},
volume = {309},
number = {7},
pages = {1909--1916},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.01.033},
doi = {10.1016/J.DISC.2008.01.033},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GeyerKV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FratiGK09,
author = {Fabrizio Frati and
Markus Geyer and
Michael Kaufmann},
title = {Planar packing of trees and spider trees},
journal = {Inf. Process. Lett.},
volume = {109},
number = {6},
pages = {301--307},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2008.11.002},
doi = {10.1016/J.IPL.2008.11.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FratiGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiKK09,
author = {Fabrizio Frati and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Constrained Simultaneous and Near-Simultaneous Embeddings},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {447--465},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00194},
doi = {10.7155/JGAA.00194},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Kaufmann09,
author = {Michael Kaufmann},
editor = {Susanne Albers and
Helmut Alt and
Stefan N{\"{a}}her},
title = {On Map Labeling with Leaders},
booktitle = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion
of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5760},
pages = {290--304},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03456-5\_20},
doi = {10.1007/978-3-642-03456-5\_20},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Kaufmann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dfg/KaufmannZ09,
author = {Michael Kaufmann and
Katharina Anna Zweig},
editor = {J{\"{u}}rgen Lerner and
Dorothea Wagner and
Katharina Anna Zweig},
title = {Modeling and Designing Real-World Networks},
booktitle = {Algorithmics of Large and Complex Networks - Design, Analysis, and
Simulation {[DFG} priority program 1126]},
series = {Lecture Notes in Computer Science},
volume = {5515},
pages = {359--379},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02094-0\_17},
doi = {10.1007/978-3-642-02094-0\_17},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/dfg/KaufmannZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniCBDFKS09,
author = {Patrizio Angelini and
Luca Cittadini and
Giuseppe Di Battista and
Walter Didimo and
Fabrizio Frati and
Michael Kaufmann and
Antonios Symvonis},
editor = {David Eppstein and
Emden R. Gansner},
title = {On the Perspectives Opened by Right Angle Crossing Drawings},
booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
pages = {21--32},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11805-0\_5},
doi = {10.1007/978-3-642-11805-0\_5},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniCBDFKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannK09,
author = {Michael Kaufmann and
Stephan Kottler},
editor = {David Eppstein and
Emden R. Gansner},
title = {Proving or Disproving Planar Straight-Line Embeddability onto Given
Rectangles},
booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
pages = {419--420},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11805-0\_44},
doi = {10.1007/978-3-642-11805-0\_44},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/KaufmannK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlbrechtEHKK09,
author = {Benjamin Albrecht and
Philip Effinger and
Markus Held and
Michael Kaufmann and
Stephan Kottler},
editor = {David Eppstein and
Emden R. Gansner},
title = {Visualization of Complex {BPEL} Models},
booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
pages = {421--423},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11805-0\_45},
doi = {10.1007/978-3-642-11805-0\_45},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlbrechtEHKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AngeliniFK09,
author = {Patrizio Angelini and
Fabrizio Frati and
Michael Kaufmann},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Straight-Line Rectangular Drawings of Clustered Graphs},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {25--36},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_3},
doi = {10.1007/978-3-642-03367-4\_3},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AngeliniFK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wecwis/EffingerSK09,
author = {Philip Effinger and
Martin Siebenhaller and
Michael Kaufmann},
editor = {Birgit Hofreiter and
Hannes Werthner},
title = {An Interactive Layout Tool for {BPMN}},
booktitle = {2009 {IEEE} Conference on Commerce and Enterprise Computing, {CEC}
2009, Vienna, Austria, July 20-23, 2009},
pages = {399--406},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CEC.2009.36},
doi = {10.1109/CEC.2009.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wecwis/EffingerSK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/SubramanianKM08,
author = {Amarendran Ramaswami Subramanian and
Michael Kaufmann and
Burkhard Morgenstern},
title = {{DIALIGN-TX:} greedy and progressive approaches for segment-based
multiple sequence alignment},
journal = {Algorithms Mol. Biol.},
volume = {3},
year = {2008},
url = {https://doi.org/10.1186/1748-7188-3-6},
doi = {10.1186/1748-7188-3-6},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/SubramanianKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/KellerBAGKKKL08,
author = {Andreas Keller and
Christina Backes and
Maher Al{-}Awadhi and
Andreas Gerasch and
Jan K{\"{u}}ntzer and
Oliver Kohlbacher and
Michael Kaufmann and
Hans{-}Peter Lenhof},
title = {GeneTrailExpress: a web-based pipeline for the statistical evaluation
of microarray experiments},
journal = {{BMC} Bioinform.},
volume = {9},
year = {2008},
url = {https://doi.org/10.1186/1471-2105-9-552},
doi = {10.1186/1471-2105-9-552},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/KellerBAGKKKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DujmovicFK08,
author = {Vida Dujmovic and
Henning Fernau and
Michael Kaufmann},
title = {Fixed parameter algorithms for one-sided crossing minimization revisited},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {313--323},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.008},
doi = {10.1016/J.JDA.2006.12.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DujmovicFK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannW08,
author = {Michael Kaufmann and
Dorothea Wagner},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {3--4},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00156},
doi = {10.7155/JGAA.00156},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKS08,
author = {Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {Efficient Labeling of Collinear Sites},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {357--380},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00170},
doi = {10.7155/JGAA.00170},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ArgyriouBKS08,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Two Polynomial Time Algorithms for the Metro-line Crossing Minimization
Problem},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {336--347},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_33},
doi = {10.1007/978-3-642-00219-9\_33},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/ArgyriouBKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannKS08,
author = {Michael Kaufmann and
Marc J. van Kreveld and
Bettina Speckmann},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Subdivision Drawings of Hypergraphs},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {396--407},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_39},
doi = {10.1007/978-3-642-00219-9\_39},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/KaufmannKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EffingerKS08,
author = {Philip Effinger and
Michael Kaufmann and
Martin Siebenhaller},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Enhancing Visualizations of Business Processes},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {437--438},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_44},
doi = {10.1007/978-3-642-00219-9\_44},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/EffingerKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08,
author = {Stephan Kottler and
Michael Kaufmann and
Carsten Sinz},
editor = {Hans Kleine B{\"{u}}ning and
Xishun Zhao},
title = {Computation of Renameable Horn Backdoors},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {154--160},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_15},
doi = {10.1007/978-3-540-79719-7\_15},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/KottlerKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08a,
author = {Stephan Kottler and
Michael Kaufmann and
Carsten Sinz},
editor = {Hans Kleine B{\"{u}}ning and
Xishun Zhao},
title = {A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {161--167},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_16},
doi = {10.1007/978-3-540-79719-7\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KottlerKS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BekosKNS08,
author = {Michael A. Bekos and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Antonios Symvonis},
editor = {Joachim Gudmundsson},
title = {Boundary Labeling with Octilinear Leaders},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {234--245},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_22},
doi = {10.1007/978-3-540-69903-3\_22},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BekosKNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BorgattiB0KLW08,
author = {Stephen P. Borgatti and
Ulrik Brandes and
Michael Kaufmann and
Stephen G. Kobourov and
Anna Lubiw and
Dorothea Wagner},
editor = {Stephen P. Borgatti and
Stephen G. Kobourov and
Oliver Kohlbacher and
Petra Mutzel},
title = {08191 Working Group Report - Visualization of Trajectories},
booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences,
04.05. - 09.05.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08191},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1555/},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BorgattiB0KLW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/KuntzerBBGKKL07,
author = {Jan K{\"{u}}ntzer and
Christina Backes and
Torsten Blum and
Andreas Gerasch and
Michael Kaufmann and
Oliver Kohlbacher and
Hans{-}Peter Lenhof},
title = {{BNDB} - The Biochemical Network Database},
journal = {{BMC} Bioinform.},
volume = {8},
year = {2007},
url = {https://doi.org/10.1186/1471-2105-8-367},
doi = {10.1186/1471-2105-8-367},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/KuntzerBBGKKL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BekosKSW07,
author = {Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis and
Alexander Wolff},
title = {Boundary labeling: Models and efficient algorithms for rectangular
maps},
journal = {Comput. Geom.},
volume = {36},
number = {3},
pages = {215--236},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.05.003},
doi = {10.1016/J.COMGEO.2006.05.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BekosKSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/BekosKS07,
author = {Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
editor = {Seok{-}Hee Hong and
Kwan{-}Liu Ma},
title = {Labeling collinear sites},
booktitle = {{APVIS} 2007, 6th International Asia-Pacific Symposium on Visualization
2007, Sydney, Australia, 5-7 February 2007},
pages = {45--51},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/APVIS.2007.329274},
doi = {10.1109/APVIS.2007.329274},
timestamp = {Thu, 27 Apr 2023 14:57:18 +0200},
biburl = {https://dblp.org/rec/conf/apvis/BekosKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/GoehlsdorfKS07,
author = {Dennis Goehlsdorf and
Michael Kaufmann and
Martin Siebenhaller},
editor = {Seok{-}Hee Hong and
Kwan{-}Liu Ma},
title = {Placing connected components of disconnected graphs},
booktitle = {{APVIS} 2007, 6th International Asia-Pacific Symposium on Visualization
2007, Sydney, Australia, 5-7 February 2007},
pages = {101--108},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/APVIS.2007.329283},
doi = {10.1109/APVIS.2007.329283},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/apvis/GoehlsdorfKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BrandesEFFGGHKKLMS07,
author = {Ulrik Brandes and
Cesim Erten and
J. Joseph Fowler and
Fabrizio Frati and
Markus Geyer and
Carsten Gutwenger and
Seok{-}Hee Hong and
Michael Kaufmann and
Stephen G. Kobourov and
Giuseppe Liotta and
Petra Mutzel and
Antonios Symvonis},
editor = {Guohui Lin},
title = {Colored Simultaneous Geometric Embeddings},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {254--263},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_26},
doi = {10.1007/978-3-540-73545-8\_26},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BrandesEFFGGHKKLMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kaufmann07,
author = {Michael Kaufmann},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Polynomial Area Bounds for {MST} Embeddings of Trees},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {88--100},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_12},
doi = {10.1007/978-3-540-77537-9\_12},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/gd/Kaufmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosKPS07,
author = {Michael A. Bekos and
Michael Kaufmann and
Katerina Potika and
Antonios Symvonis},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Line Crossing Minimization on Metro Maps},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {231--242},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_24},
doi = {10.1007/978-3-540-77537-9\_24},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosKPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FratiKK07,
author = {Fabrizio Frati and
Michael Kaufmann and
Stephen G. Kobourov},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Constrained Simultaneous and Near-Simultaneous Embeddings},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {268--279},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_27},
doi = {10.1007/978-3-540-77537-9\_27},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/FratiKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FratiGK07,
author = {Fabrizio Frati and
Markus Geyer and
Michael Kaufmann},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Packing and Squeezing Subgraphs into Planar Graphs},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {394--405},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_36},
doi = {10.1007/978-3-540-74456-6\_36},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FratiGK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/LuxburgBJK07,
author = {Ulrike von Luxburg and
S{\'{e}}bastien Bubeck and
Stefanie Jegelka and
Michael Kaufmann},
editor = {John C. Platt and
Daphne Koller and
Yoram Singer and
Sam T. Roweis},
title = {Consistent Minimization of Clustering Objective Functions},
booktitle = {Advances in Neural Information Processing Systems 20, Proceedings
of the Twenty-First Annual Conference on Neural Information Processing
Systems, Vancouver, British Columbia, Canada, December 3-6, 2007},
pages = {961--968},
publisher = {Curran Associates, Inc.},
year = {2007},
url = {https://proceedings.neurips.cc/paper/2007/hash/faa9afea49ef2ff029a833cccc778fd0-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/LuxburgBJK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2006,
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
Germany, September 18-20, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4372},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70904-6},
doi = {10.1007/978-3-540-70904-6},
isbn = {978-3-540-70903-9},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/LehmannKSN06,
author = {Katharina Anna Lehmann and
Michael Kaufmann and
Stephan Steigele and
Kay Nieselt},
title = {On the maximal cliques in \emph{c}-max-tolerance graphs and their
application in clustering molecular sequences},
journal = {Algorithms Mol. Biol.},
volume = {1},
year = {2006},
url = {https://doi.org/10.1186/1748-7188-1-9},
doi = {10.1186/1748-7188-1-9},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/LehmannKSN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ivs/BlochingerKS06,
author = {Wolfgang Blochinger and
Michael Kaufmann and
Martin Siebenhaller},
title = {Visualization aided performance tuning of irregular task-parallel
computations},
journal = {Inf. Vis.},
volume = {5},
number = {2},
pages = {81--94},
year = {2006},
url = {https://doi.org/10.1057/palgrave.ivs.9500123},
doi = {10.1057/PALGRAVE.IVS.9500123},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ivs/BlochingerKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jib/KuntzerBGBHKKL06,
author = {Jan K{\"{u}}ntzer and
Torsten Blum and
Andreas Gerasch and
Christina Backes and
Andreas Hildebrandt and
Michael Kaufmann and
Oliver Kohlbacher and
Hans{-}Peter Lenhof},
title = {{BN++} - {A} Biological Information System},
journal = {J. Integr. Bioinform.},
volume = {3},
number = {2},
year = {2006},
url = {https://doi.org/10.2390/biecoll-jib-2006-34},
doi = {10.2390/BIECOLL-JIB-2006-34},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jib/KuntzerBGBHKKL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/BekosKPS06,
author = {Michael A. Bekos and
Michael Kaufmann and
Katerina Potika and
Antonios Symvonis},
editor = {Kazuo Misue and
Kozo Sugiyama and
Jiro Tanaka},
title = {Polygon labelling of minimum leader length},
booktitle = {Asia-Pacific Symposium on Information Visualisation, {APVIS} 2006,
Tokyo, Japan, February 1-3, 2006},
series = {{CRPIT}},
volume = {60},
pages = {15--21},
publisher = {Australian Computer Society},
year = {2006},
url = {https://dl.acm.org/citation.cfm?id=1151906},
timestamp = {Wed, 28 Nov 2018 12:57:16 +0100},
biburl = {https://dblp.org/rec/conf/apvis/BekosKPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/KrizancKFZ06,
author = {Danny Krizanc and
Michael Kaufmann and
Pierre Fraigniaud and
Christos D. Zaroliagis},
editor = {Wolfgang E. Nagel and
Wolfgang V. Walter and
Wolfgang Lehner},
title = {Topic 12: Theory and Algorithms for Parallel Computation},
booktitle = {Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference,
Dresden, Germany, August 28 - September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4128},
pages = {799},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11823285\_83},
doi = {10.1007/11823285\_83},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/KrizancKFZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BekosKPS06,
author = {Michael A. Bekos and
Michael Kaufmann and
Katerina Potika and
Antonios Symvonis},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Multi-stack Boundary Labeling Problems},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {81--92},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_10},
doi = {10.1007/11944836\_10},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BekosKPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaufmannKLS06,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Katharina Anna Lehmann and
Amarendran Ramaswami Subramanian},
title = {Max-tolerance graphs as intersection graphs: cliques, cycles, and
recognition},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {832--841},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109649},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KaufmannKLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/softvis/SiebenhallerK06,
author = {Martin Siebenhaller and
Michael Kaufmann},
editor = {Eileen T. Kraemer and
Margaret M. Burnett and
Stephan Diehl},
title = {Drawing activity diagrams},
booktitle = {Proceedings of the {ACM} 2006 Symposium on Software Visualization,
Brighton, UK, September 4-5, 2006},
pages = {159--160},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1148493.1148523},
doi = {10.1145/1148493.1148523},
timestamp = {Tue, 28 Apr 2020 17:37:56 +0200},
biburl = {https://dblp.org/rec/conf/softvis/SiebenhallerK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/SubramanianWKM05,
author = {Amarendran Ramaswami Subramanian and
Jan Weyer{-}Menkhoff and
Michael Kaufmann and
Burkhard Morgenstern},
title = {{DIALIGN-T:} An improved algorithm for segment-based multiple sequence
alignment},
journal = {{BMC} Bioinform.},
volume = {6},
pages = {66},
year = {2005},
url = {https://doi.org/10.1186/1471-2105-6-66},
doi = {10.1186/1471-2105-6-66},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/SubramanianWKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EiglspergerSK05,
author = {Markus Eiglsperger and
Martin Siebenhaller and
Michael Kaufmann},
title = {An Efficient Implementation of Sugiyama's Algorithm for Layered Graph
Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {305--325},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00111},
doi = {10.7155/JGAA.00111},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EiglspergerSK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/FeketeKKL05,
author = {S{\'{a}}ndor P. Fekete and
Michael Kaufmann and
Alexander Kr{\"{o}}ller and
Katharina Anna Lehmann},
title = {A New Approach for Boundary Recognition in Geometric Sensor Networks},
booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry,
CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
pages = {84--87},
year = {2005},
url = {http://www.cccg.ca/proceedings/2005/31.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/FeketeKKL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FernauKP05,
author = {Henning Fernau and
Michael Kaufmann and
Mathias Poths},
editor = {Ramaswamy Ramanujam and
Sandeep Sen},
title = {Comparing Trees Via Crossing Minimization},
booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
Computer Science, 25th International Conference, Hyderabad, India,
December 15-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3821},
pages = {457--469},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11590156\_37},
doi = {10.1007/11590156\_37},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FernauKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/GeyerKV05,
author = {Markus Geyer and
Michael Kaufmann and
Imrich Vrto},
editor = {Patrick Healy and
Nikola S. Nikolov},
title = {Two Trees Which Are Self-intersecting When Drawn Simultaneously},
booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
Ireland, September 12-14, 2005, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3843},
pages = {201--210},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11618058\_19},
doi = {10.1007/11618058\_19},
timestamp = {Sun, 13 Nov 2022 09:57:32 +0100},
biburl = {https://dblp.org/rec/conf/gd/GeyerKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/SiebenhallerK05,
author = {Martin Siebenhaller and
Michael Kaufmann},
editor = {Patrick Healy and
Nikola S. Nikolov},
title = {Mixed Upward Planarization - Fast and Robust},
booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
Ireland, September 12-14, 2005, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3843},
pages = {522--523},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11618058\_52},
doi = {10.1007/11618058\_52},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/SiebenhallerK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/LehmannK05,
author = {Katharina Anna Lehmann and
Michael Kaufmann},
editor = {Hans{-}Georg Beyer and
Una{-}May O'Reilly},
title = {Evolutionary algorithms for the self-organized evolution of networks},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2005, Proceedings,
Washington DC, USA, June 25-29, 2005},
pages = {563--570},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1068009.1068105},
doi = {10.1145/1068009.1068105},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/LehmannK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pci/BekosKPS05,
author = {Michael A. Bekos and
Michael Kaufmann and
Katerina Potika and
Antonios Symvonis},
editor = {Panayiotis Bozanis and
Elias N. Houstis},
title = {Boundary Labelling of Optimal Total Leader Length},
booktitle = {Advances in Informatics, 10th Panhellenic Conference on Informatics,
{PCI} 2005, Volos, Greece, November 11-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3746},
pages = {80--89},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11573036\_8},
doi = {10.1007/11573036\_8},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pci/BekosKPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/softvis/BlochingerKS05,
author = {Wolfgang Blochinger and
Michael Kaufmann and
Martin Siebenhaller},
editor = {Thomas L. Naps and
Wim De Pauw},
title = {Visualizing structural properties of irregular parallel computations},
booktitle = {Proceedings of the {ACM} 2005 Symposium on Software Visualization,
St. Louis, Missouri, USA, May 14-15, 2005},
pages = {125--134},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1056018.1056036},
doi = {10.1145/1056018.1056036},
timestamp = {Thu, 09 May 2019 13:10:55 +0200},
biburl = {https://dblp.org/rec/conf/softvis/BlochingerKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/p2p/LehmannK05,
author = {Katharina Anna Lehmann and
Michael Kaufmann},
editor = {Ralf Steinmetz and
Klaus Wehrle},
title = {Random Graphs, Small-Worlds and Scale-Free Networks},
booktitle = {Peer-to-Peer Systems and Applications},
series = {Lecture Notes in Computer Science},
volume = {3485},
pages = {57--76},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11530657\_6},
doi = {10.1007/11530657\_6},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/p2p/LehmannK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0508006,
author = {S{\'{a}}ndor P. Fekete and
Michael Kaufmann and
Alexander Kr{\"{o}}ller and
Katharina Anna Lehmann},
title = {A New Approach for Boundary Recognition in Geometric Sensor Networks},
journal = {CoRR},
volume = {abs/cs/0508006},
year = {2005},
url = {http://arxiv.org/abs/cs/0508006},
eprinttype = {arXiv},
eprint = {cs/0508006},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0508006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/SchmollingerNKM04,
author = {Martin Schmollinger and
Kay Nieselt and
Michael Kaufmann and
Burkhard Morgenstern},
title = {{DIALIGN} {P:} Fast pair-wise and multiple sequence alignment using
parallel processors},
journal = {{BMC} Bioinform.},
volume = {5},
pages = {128},
year = {2004},
url = {https://doi.org/10.1186/1471-2105-5-128},
doi = {10.1186/1471-2105-5-128},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/SchmollingerNKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ivs/EiglspergerGKKJLKMS04,
author = {Markus Eiglsperger and
Carsten Gutwenger and
Michael Kaufmann and
Joachim Kupke and
Michael J{\"{u}}nger and
Sebastian Leipert and
Karsten Klein and
Petra Mutzel and
Martin Siebenhaller},
title = {Automatic layout of {UML} class diagrams in orthogonal style},
journal = {Inf. Vis.},
volume = {3},
number = {3},
pages = {189--208},
year = {2004},
url = {https://doi.org/10.1057/palgrave.ivs.9500078},
doi = {10.1057/PALGRAVE.IVS.9500078},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ivs/EiglspergerGKKJLKMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosKSW04,
author = {Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis and
Alexander Wolff},
editor = {J{\'{a}}nos Pach},
title = {Boundary Labeling: Models and Efficient Algorithms for Rectangular
Maps},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {49--59},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_7},
doi = {10.1007/978-3-540-31843-9\_7},
timestamp = {Sun, 13 Nov 2022 09:57:33 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosKSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EiglspergerAK04,
author = {Markus Eiglsperger and
Martin Siebenhaller and
Michael Kaufmann},
editor = {J{\'{a}}nos Pach},
title = {An Efficient Implementation of Sugiyama's Algorithm for Layered Graph
Drawing},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {155--166},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_17},
doi = {10.1007/978-3-540-31843-9\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/EiglspergerAK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/04/WieseE004,
author = {Roland Wiese and
Markus Eiglsperger and
Michael Kaufmann},
editor = {Michael J{\"{u}}nger and
Petra Mutzel},
title = {\emph{yFiles} - Visualization and Automatic Layout of Graphs},
booktitle = {Graph Drawing Software},
pages = {173--191},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-642-18638-7\_8},
doi = {10.1007/978-3-642-18638-7\_8},
timestamp = {Sat, 03 Aug 2019 22:40:46 +0200},
biburl = {https://dblp.org/rec/books/sp/04/WieseE004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SchmollingerK03,
author = {Martin Schmollinger and
Michael Kaufmann},
title = {Designing Parallel Algorithms for Hierarchical {SMP} Clusters},
journal = {Int. J. Found. Comput. Sci.},
volume = {14},
number = {1},
pages = {59--78},
year = {2003},
url = {https://doi.org/10.1142/S0129054103001595},
doi = {10.1142/S0129054103001595},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/SchmollingerK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EiglspergerKE03,
author = {Markus Eiglsperger and
Michael Kaufmann and
Frank Eppinger},
title = {An Approach for Mixed Upward Planarization},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {203--220},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00067},
doi = {10.7155/JGAA.00067},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EiglspergerKE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/KaklamanisKFK03,
author = {Christos Kaklamanis and
Danny Krizanc and
Pierre Fraigniaud and
Michael Kaufmann},
editor = {Harald Kosch and
L{\'{a}}szl{\'{o}} B{\"{o}}sz{\"{o}}rm{\'{e}}nyi and
Hermann Hellwagner},
title = {Topic Introduction},
booktitle = {Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference,
Klagenfurt, Austria, August 26-29, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2790},
pages = {884},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45209-6\_121},
doi = {10.1007/978-3-540-45209-6\_121},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/KaklamanisKFK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DujmovicFK03,
author = {Vida Dujmovic and
Henning Fernau and
Michael Kaufmann},
editor = {Giuseppe Liotta},
title = {Fixed Parameter Algorithms for one-sided crossing minimization Revisited},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {332--344},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_31},
doi = {10.1007/978-3-540-24595-7\_31},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DujmovicFK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/softvis/EiglspergerKS03,
author = {Markus Eiglsperger and
Michael Kaufmann and
Martin Siebenhaller},
editor = {Stephan Diehl and
John T. Stasko and
Stephen N. Spencer},
title = {A Topology-Shape-Metrics Approach for the Automatic Layout of {UML}
Class Diagram},
booktitle = {Proceedings {ACM} 2003 Symposium on Software Visualization, San Diego,
California, USA, June 11-13, 2003},
pages = {189--198},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/774833.774860},
doi = {10.1145/774833.774860},
timestamp = {Thu, 09 May 2019 13:10:55 +0200},
biburl = {https://dblp.org/rec/conf/softvis/EiglspergerKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannW02,
author = {Michael Kaufmann and
Roland Wiese},
title = {Embedding Vertices at Points: Few Bends Suffice for Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {115--129},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00046},
doi = {10.7155/JGAA.00046},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Kaufmann02,
author = {Michael Kaufmann},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {177--178},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00050},
doi = {10.7155/JGAA.00050},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Kaufmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eccb/SiravaSEKKBL02,
author = {Marite Sirava and
T. Sch{\"{a}}fer and
Markus Eiglsperger and
Michael Kaufmann and
Oliver Kohlbacher and
Erich Bornberg{-}Bauer and
Hans{-}Peter Lenhof},
title = {BioMiner - modeling, analyzing, and visualizing biochemical pathways
and networks},
booktitle = {Proceedings of the European Conference on Computational Biology {(ECCB}
2002), October 6-9, 2002, Saarbr{\"{u}}cken, Germany},
pages = {219--230},
year = {2002},
timestamp = {Thu, 23 Jun 2016 15:53:27 +0200},
biburl = {https://dblp.org/rec/conf/eccb/SiravaSEKKBL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecis/KratschmerK02,
author = {Thomas Kr{\"{a}}tschmer and
Michael Kaufmann},
editor = {Stanislaw Wrycza},
title = {Electronic brainstorming with graphical structures of ideas},
booktitle = {Proceedings of the 10th European Conference on Information Systems,
Information Systems and the Future of the Digital Economy, {ECIS}
2002, Gdansk, Poland, June 6-8, 2002},
pages = {120--130},
year = {2002},
url = {http://aisel.aisnet.org/ecis2002/80},
timestamp = {Mon, 05 Dec 2016 15:14:00 +0100},
biburl = {https://dblp.org/rec/conf/ecis/KratschmerK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BrandesEKW02,
author = {Ulrik Brandes and
Markus Eiglsperger and
Michael Kaufmann and
Dorothea Wagner},
editor = {Stephen G. Kobourov and
Michael T. Goodrich},
title = {Sketch-Driven Orthogonal Graph Drawing},
booktitle = {Graph Drawing, 10th International Symposium, {GD} 2002, Irvine, CA,
USA, August 26-28, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2528},
pages = {1--11},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36151-0\_1},
doi = {10.1007/3-540-36151-0\_1},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/BrandesEKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannW02,
author = {Michael Kaufmann and
Roland Wiese},
editor = {Stephen G. Kobourov and
Michael T. Goodrich},
title = {Maintaining the Mental Map for Circular Drawings},
booktitle = {Graph Drawing, 10th International Symposium, {GD} 2002, Irvine, CA,
USA, August 26-28, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2528},
pages = {12--22},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36151-0\_2},
doi = {10.1007/3-540-36151-0\_2},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/KaufmannW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gi/Kaufmann02,
author = {Michael Kaufmann},
editor = {Sigrid E. Schubert and
Bernd Reusch and
Norbert Jesse},
title = {Graph Drawing Algorithms for Bioinformatics},
booktitle = {32. Jahrestagung der Gesellschaft f{\"{u}}r Informatik, Informatik
bewegt, {INFORMATIK} 2002, Dortmund, Germany, September 30 - October
3, 2002, Erg{\"{a}}nzungsband},
series = {{LNI}},
volume = {{P-20}},
pages = {65--66},
publisher = {{GI}},
year = {2002},
url = {https://dl.gi.de/handle/20.500.12116/30193},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gi/Kaufmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/SchmollingerK02,
author = {Martin Schmollinger and
Michael Kaufmann},
title = {Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication},
booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS}
2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts
Proceedings},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/IPDPS.2002.1016540},
doi = {10.1109/IPDPS.2002.1016540},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/SchmollingerK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/AdebiyiK02,
author = {Ezekiel F. Adebiyi and
Michael Kaufmann},
editor = {Roderic Guig{\'{o}} and
Dan Gusfield},
title = {Extracting Common Motifs under the Levenshtein Measure: Theory and
Experimentation},
booktitle = {Algorithms in Bioinformatics, Second International Workshop, {WABI}
2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2452},
pages = {140--156},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45784-4\_11},
doi = {10.1007/3-540-45784-4\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/AdebiyiK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/DieboldK01,
author = {Boris Diebold and
Michael Kaufmann},
editor = {Peter Eades and
Tim Pattison},
title = {Usage-based Visualization of Web Locations},
booktitle = {Australasian Symposium on Information Visualisation, InVis.au, Sydney,
Australia, 3-4 December 2001},
series = {{CRPIT}},
volume = {9},
pages = {159--164},
publisher = {Australian Computer Society},
year = {2001},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV9Diebold.html},
timestamp = {Thu, 25 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/apvis/DieboldK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EiglspergerK01,
author = {Markus Eiglsperger and
Michael Kaufmann},
editor = {Petra Mutzel and
Michael J{\"{u}}nger and
Sebastian Leipert},
title = {Fast Compaction for Orthogonal Drawings with Vertices of Prescribed
Size},
booktitle = {Graph Drawing, 9th International Symposium, {GD} 2001 Vienna, Austria,
September 23-26, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2265},
pages = {124--138},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45848-4\_11},
doi = {10.1007/3-540-45848-4\_11},
timestamp = {Sun, 13 Nov 2022 09:57:35 +0100},
biburl = {https://dblp.org/rec/conf/gd/EiglspergerK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/WieseEK00,
author = {Roland Wiese and
Markus Eiglsperger and
Michael Kaufmann},
editor = {Petra Mutzel and
Michael J{\"{u}}nger and
Sebastian Leipert},
title = {yFiles: Visualization and Automatic Layout of Graphs},
booktitle = {Graph Drawing, 9th International Symposium, {GD} 2001 Vienna, Austria,
September 23-26, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2265},
pages = {453--454},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45848-4\_42},
doi = {10.1007/3-540-45848-4\_42},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/WieseEK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/AdebiyiJK01,
author = {Ezekiel F. Adebiyi and
Tao Jiang and
Michael Kaufmann},
title = {An efficient algorithm for finding short approximate non-tandem repeats},
booktitle = {Proceedings of the Ninth International Conference on Intelligent Systems
for Molecular Biology, July 21-25, 2001, Copenhagen, Denmark},
pages = {5--12},
year = {2001},
timestamp = {Thu, 31 Mar 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ismb/AdebiyiJK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppam/SchmollingerK01,
author = {Martin Schmollinger and
Michael Kaufmann},
editor = {Roman Wyrzykowski and
Jack J. Dongarra and
Marcin Paprzycki and
Jerzy Wasniewski},
title = {kappa {NUMA:} {A} Model for Clusters of SMP-Machines},
booktitle = {Parallel Processing and Applied Mathematics, 4th International Conference,
{PPAM} 2001 Naleczow, Poland, September 9-12, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2328},
pages = {42--50},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48086-2\_5},
doi = {10.1007/3-540-48086-2\_5},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ppam/SchmollingerK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EiglspergerK01,
author = {Markus Eiglsperger and
Michael Kaufmann},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {An Approach for Mixed Upward Planarization},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {352--364},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_33},
doi = {10.1007/3-540-44634-6\_33},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/EiglspergerK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/1999dg,
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl
Seminar, April 1999)},
series = {Lecture Notes in Computer Science},
volume = {2025},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44969-8},
doi = {10.1007/3-540-44969-8},
isbn = {3-540-42062-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/1999dg.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FossmeierK00,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
title = {On Exact Solutions for the Rectilinear Steiner Tree Problem Part {I:}
Theoretical Results},
journal = {Algorithmica},
volume = {26},
number = {1},
pages = {68--99},
year = {2000},
url = {https://doi.org/10.1007/s004539910005},
doi = {10.1007/S004539910005},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FossmeierK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EiglspergerFK00,
author = {Markus Eiglsperger and
Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {David B. Shmoys},
title = {Orthogonal graph drawing with constraints},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {3--11},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338225},
timestamp = {Wed, 10 Dec 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EiglspergerFK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannW99,
author = {Michael Kaufmann and
Roland Wiese},
editor = {Jan Kratochv{\'{\i}}l},
title = {Embedding Vertices at Points: Few Bends Suffice for Planar Graphs},
booktitle = {Graph Drawing, 7th International Symposium, GD'99, Stir{\'{\i}}n
Castle, Czech Republic, September 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1731},
pages = {165--174},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46648-7\_17},
doi = {10.1007/3-540-46648-7\_17},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/KaufmannW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FossmeierHK98,
author = {Ulrich F{\"{o}}{\ss}meier and
Carsten He{\ss} and
Michael Kaufmann},
editor = {Sue Whitesides},
title = {On Improving Orthogonal Drawings: The 4M-Algorithm},
booktitle = {Graph Drawing, 6th International Symposium, GD'98, Montr{\'{e}}al,
Canada, August 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1547},
pages = {125--137},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-37623-2\_10},
doi = {10.1007/3-540-37623-2\_10},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/FossmeierHK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/SteckelbachBFKRR98,
author = {Bj{\"{o}}rn Steckelbach and
Till Bubeck and
Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann and
Marcus Ritt and
Wolfgang Rosenstiel},
editor = {Sue Whitesides},
title = {Visualization of Parallel Execution Graphs},
booktitle = {Graph Drawing, 6th International Symposium, GD'98, Montr{\'{e}}al,
Canada, August 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1547},
pages = {403--412},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-37623-2\_32},
doi = {10.1007/3-540-37623-2\_32},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/SteckelbachBFKRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/WieseK98,
author = {Roland Wiese and
Michael Kaufmann},
editor = {Sue Whitesides},
title = {Adding Constraints to an Algorithm for Orthogonal Graph Drawing},
booktitle = {Graph Drawing, 6th International Symposium, GD'98, Montr{\'{e}}al,
Canada, August 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1547},
pages = {462--463},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-37623-2\_47},
doi = {10.1007/3-540-37623-2\_47},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/WieseK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiedlKM98,
author = {Therese C. Biedl and
Michael Kaufmann and
Petra Mutzel},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Drawing Planar Partitions {II:} HH-Drawings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {124--136},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_11},
doi = {10.1007/10692760\_11},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BiedlKM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaufmannS97,
author = {Michael Kaufmann and
Jop F. Sibeyn},
title = {Randomized Multipacket Routing and Sorting on Meshes},
journal = {Algorithmica},
volume = {17},
number = {3},
pages = {224--244},
year = {1997},
url = {https://doi.org/10.1007/BF02523190},
doi = {10.1007/BF02523190},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaufmannS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaufmannRS97,
author = {Michael Kaufmann and
Rajeev Raman and
Jop F. Sibeyn},
title = {Routing on Meshes with Buses},
journal = {Algorithmica},
volume = {18},
number = {3},
pages = {417--444},
year = {1997},
url = {https://doi.org/10.1007/PL00009164},
doi = {10.1007/PL00009164},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaufmannRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiedlKK97,
author = {Therese C. Biedl and
Goos Kant and
Michael Kaufmann},
title = {On Triangulating Planar Graphs Under the Four-Connectivity Constraint},
journal = {Algorithmica},
volume = {19},
number = {4},
pages = {427--446},
year = {1997},
url = {https://doi.org/10.1007/PL00009182},
doi = {10.1007/PL00009182},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiedlKK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cai/KaufmannMS97,
author = {Michael Kaufmann and
Ulrich Meyer and
Jop F. Sibeyn},
title = {Matrix Transpose on Meshes: Theory and Practice},
journal = {Comput. Artif. Intell.},
volume = {16},
number = {2},
pages = {107--140},
year = {1997},
url = {http://www.cai.sk/ojs/index.php/cai/article/view/664},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cai/KaufmannMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FossmeierKZ97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann and
Alexander Zelikovsky},
title = {Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem},
journal = {Discret. Comput. Geom.},
volume = {18},
number = {1},
pages = {93--109},
year = {1997},
url = {https://doi.org/10.1007/PL00009310},
doi = {10.1007/PL00009310},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FossmeierKZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/SibeynCK97,
author = {Jop F. Sibeyn and
Bogdan S. Chlebus and
Michael Kaufmann},
title = {Deterministic Permutation Routing on Meshes},
journal = {J. Algorithms},
volume = {22},
number = {1},
pages = {111--141},
year = {1997},
url = {https://doi.org/10.1006/jagm.1995.0804},
doi = {10.1006/JAGM.1995.0804},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/SibeynCK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FossmeierK97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Nice Drawings for Planar Bipartite Graphs},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {122--134},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_66},
doi = {10.1007/3-540-62592-5\_66},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FossmeierK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SibeynK97,
author = {Jop F. Sibeyn and
Michael Kaufmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {BSP-Like External-Memory Computation},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {229--240},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_75},
doi = {10.1007/3-540-62592-5\_75},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SibeynK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FossmeierK97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Jean{-}Daniel Boissonnat},
title = {On Exact Solutions for the Rectilinear Steiner Tree Problem},
booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry,
Nice, France, June 4-6, 1997},
pages = {436--438},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/262839.263071},
doi = {10.1145/262839.263071},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FossmeierK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiedlK97,
author = {Therese C. Biedl and
Michael Kaufmann},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Area-Efficient Static and Incremental Graph Drawings},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {37--52},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_4},
doi = {10.1007/3-540-63397-9\_4},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BiedlK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FossmeierK97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {171--185},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_14},
doi = {10.1007/3-540-63397-9\_14},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FossmeierK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FossmeierK97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Giuseppe Di Battista},
title = {Algorithms and Area Bounds for Nonplanar Orthogonal Drawings},
booktitle = {Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy,
September 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1353},
pages = {134--145},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63938-1\_57},
doi = {10.1007/3-540-63938-1\_57},
timestamp = {Sun, 13 Nov 2022 09:57:37 +0100},
biburl = {https://dblp.org/rec/conf/gd/FossmeierK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/KaufmannMS97,
author = {Michael Kaufmann and
Ulrich Meyer and
Jop F. Sibeyn},
title = {Matrix Transpose on Meshes: Theory and Practice},
booktitle = {11th International Parallel Processing Symposium {(IPPS} '97), 1-5
April 1997, Geneva, Switzerland, Proceedings},
pages = {315--319},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/IPPS.1997.580918},
doi = {10.1109/IPPS.1997.580918},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/KaufmannMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcsc/KaufmannGT96,
author = {Michael Kaufmann and
Shaodi Gao and
Krishnaiyan Thulasiraman},
title = {An Algorithm for Steiner Trees in Grid Graphs and its Application
to Homotopic Routing},
journal = {J. Circuits Syst. Comput.},
volume = {6},
number = {1},
pages = {1--14},
year = {1996},
url = {https://doi.org/10.1142/S0218126696000029},
doi = {10.1142/S0218126696000029},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcsc/KaufmannGT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FossmeierKK96,
author = {Ulrich F{\"{o}}{\ss}meier and
Goos Kant and
Michael Kaufmann},
editor = {Stephen C. North},
title = {2-Visibility Drawings of Planar Graphs},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '96, Berkeley, California,
USA, September 18-20, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1190},
pages = {155--168},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62495-3\_45},
doi = {10.1007/3-540-62495-3\_45},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/FossmeierKK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/KaufmannSS95,
author = {Michael Kaufmann and
Heiko Schr{\"{o}}der and
Jop F. Sibeyn},
title = {Routing and Sorting on Reconfigurable Meshes},
journal = {Parallel Process. Lett.},
volume = {5},
pages = {81--95},
year = {1995},
url = {https://doi.org/10.1142/S0129626495000084},
doi = {10.1142/S0129626495000084},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/KaufmannSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KaufmannSS95,
author = {Michael Kaufmann and
Jop F. Sibeyn and
Torsten Suel},
editor = {Paul G. Spirakis},
title = {Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on
Meshes},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {75--88},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_135},
doi = {10.1007/3-540-60313-1\_135},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KaufmannSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FossmeierK95,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Franz{-}Josef Brandenburg},
title = {Drawing High Degree Graphs with Low Bend Numbers},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany,
September 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1027},
pages = {254--266},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0021809},
doi = {10.1007/BFB0021809},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/FossmeierK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/SibeynK95,
author = {Jop F. Sibeyn and
Michael Kaufmann},
editor = {Jir{\'{\i}} Wiedermann and
Petr H{\'{a}}jek},
title = {Solving Cheap Graph Problems an Meshes},
booktitle = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {969},
pages = {412--422},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60246-1\_147},
doi = {10.1007/3-540-60246-1\_147},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/SibeynK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GaoK94,
author = {Shaodi Gao and
Michael Kaufmann},
title = {Channel Routing of Multiterminal Nets},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {791--818},
year = {1994},
url = {https://doi.org/10.1145/179812.179927},
doi = {10.1145/179812.179927},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GaoK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaufmannM94,
author = {Michael Kaufmann and
Kurt Mehlhorn},
title = {A Linear-Time Algorithm for the Homotopic Routing Problem in Grid
Graphs},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {2},
pages = {227--246},
year = {1994},
url = {https://doi.org/10.1137/S0097539789162109},
doi = {10.1137/S0097539789162109},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaufmannM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BermanFKKZ94,
author = {Piotr Berman and
Ulrich F{\"{o}}{\ss}meier and
Marek Karpinski and
Michael Kaufmann and
Alexander Zelikovsky},
editor = {Jan van Leeuwen},
title = {Approaching the 5/4-Approximation for Rectilinear Steiner Trees},
booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
The Netherlands, September 26-28, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {855},
pages = {60--71},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0049397},
doi = {10.1007/BFB0049397},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BermanFKKZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FossmeierK94,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Roberto Tamassia and
Ioannis G. Tollis},
title = {On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs},
booktitle = {Graph Drawing, {DIMACS} International Workshop, {GD} '94, Princeton,
New Jersey, USA, October 10-12, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {894},
pages = {52--63},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58950-3\_356},
doi = {10.1007/3-540-58950-3\_356},
timestamp = {Sun, 13 Nov 2022 09:57:39 +0100},
biburl = {https://dblp.org/rec/conf/gd/FossmeierK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KaufmannLS94,
author = {Michael Kaufmann and
Harald Lauer and
Heiko Schr{\"{o}}der},
editor = {Ding{-}Zhu Du and
Xiang{-}Sun Zhang},
title = {Fast Deterministic Hot-Potato Routing on Processor Arrays},
booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
Beijing, P. R. China, August 25-27, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {834},
pages = {333--341},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58325-4\_197},
doi = {10.1007/3-540-58325-4\_197},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KaufmannLS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KaufmannGT94,
author = {Michael Kaufmann and
Shaodi Gao and
Krishnaiyan Thulasiraman},
editor = {Ding{-}Zhu Du and
Xiang{-}Sun Zhang},
title = {On Steiner Minimal Trees in Grid Graphs and Its Application to {VLSI}
Routing},
booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
Beijing, P. R. China, August 25-27, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {834},
pages = {351--359},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58325-4\_199},
doi = {10.1007/3-540-58325-4\_199},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KaufmannGT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/SibeynCK94,
author = {Jop F. Sibeyn and
Bogdan S. Chlebus and
Michael Kaufmann},
editor = {Igor Pr{\'{\i}}vara and
Branislav Rovan and
Peter Ruzicka},
title = {Shorter Queues for Permutation Routing on Meshes},
booktitle = {Mathematical Foundations of Computer Science 1994, 19th International
Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {841},
pages = {597--607},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58338-6\_106},
doi = {10.1007/3-540-58338-6\_106},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/SibeynCK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaufmannSS94,
author = {Michael Kaufmann and
Jop F. Sibeyn and
Torsten Suel},
editor = {Daniel Dominic Sleator},
title = {Derandomizing Algorithms for Routing and Sorting on Meshes},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {669--679},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314670},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/KaufmannSS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/KaufmannMS94,
author = {Michael Kaufmann and
Ulrich Meyer and
Jop F. Sibeyn},
title = {Towards practical permutation routing on meshes},
booktitle = {Proceedings of the Sixth {IEEE} Symposium on Parallel and Distributed
Processing, {SPDP} 1994, Dallas, Texas, {USA} , October 26-29, 1994},
pages = {664--671},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SPDP.1994.346110},
doi = {10.1109/SPDP.1994.346110},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spdp/KaufmannMS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SibeynK94,
author = {Jop F. Sibeyn and
Michael Kaufmann},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Deterministic 1-k Routing on Meshes},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {237--248},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_145},
doi = {10.1007/3-540-57785-8\_145},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SibeynK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiedlKK94,
author = {Therese C. Biedl and
Goos Kant and
Michael Kaufmann},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {On Triangulating Planar Graphs under the Four-Connectivity Constraint},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {83--94},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_8},
doi = {10.1007/3-540-58218-5\_8},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiedlKK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaufmannM93,
author = {Michael Kaufmann and
F. Miller Maley},
title = {Parity Conditions in Homotopic Knock-Knee Routing},
journal = {Algorithmica},
volume = {9},
number = {1},
pages = {47--63},
year = {1993},
url = {https://doi.org/10.1007/BF01185338},
doi = {10.1007/BF01185338},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaufmannM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KaufmannK93,
author = {Michael Kaufmann and
Gerhard Kl{\"{a}}r},
title = {Routing in Polygons without Rectilinear Visible Corners},
journal = {Inf. Comput.},
volume = {102},
number = {2},
pages = {218--262},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1008},
doi = {10.1006/INCO.1993.1008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KaufmannK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FormannHHKLSWW93,
author = {Michael Formann and
Torben Hagerup and
James Haralambides and
Michael Kaufmann and
Frank Thomson Leighton and
Antonios Symvonis and
Emo Welzl and
Gerhard J. Woeginger},
title = {Drawing Graphs in the Plane with High Resolution},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {5},
pages = {1035--1052},
year = {1993},
url = {https://doi.org/10.1137/0222063},
doi = {10.1137/0222063},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FormannHHKLSWW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SibeynKR93,
author = {Jop F. Sibeyn and
Michael Kaufmann and
Rajeev Raman},
editor = {Thomas Lengauer},
title = {Randomized Routing on Meshes with Buses},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {333--344},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_68},
doi = {10.1007/3-540-57273-2\_68},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SibeynKR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FossmeierKZ93,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann and
Alexander Zelikovsky},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {533--542},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_285},
doi = {10.1007/3-540-57568-5\_285},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FossmeierKZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/ChlebusKS93,
author = {Bogdan S. Chlebus and
Michael Kaufmann and
Jop F. Sibeyn},
title = {Deterministic Permutation Routing on Meshes},
booktitle = {Proceedings of the Fifth {IEEE} Symposium on Parallel and Distributed
Processing, {SPDP} 1993, Dallas, Texas, USA, December 2-5, 1993},
pages = {284},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SPDP.1993.395448},
doi = {10.1109/SPDP.1993.395448},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spdp/ChlebusKS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltFKMNSU92,
author = {Helmut Alt and
Rudolf Fleischer and
Michael Kaufmann and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Stefan Schirra and
Christian Uhrig},
title = {Approximate Motion Planning and the Complexity of the Boundary of
the Union of Simple Geometric Figures},
journal = {Algorithmica},
volume = {8},
number = {5{\&}6},
pages = {391--406},
year = {1992},
url = {https://doi.org/10.1007/BF01758853},
doi = {10.1007/BF01758853},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AltFKMNSU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KaufmannM92,
author = {Michael Kaufmann and
Kurt Mehlhorn},
title = {On local routing of two-terminal nets},
journal = {J. Comb. Theory, Ser. {B}},
volume = {55},
number = {1},
pages = {33--72},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90031-R},
doi = {10.1016/0095-8956(92)90031-R},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KaufmannM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/KaufmannRS92,
author = {Michael Kaufmann and
Sanguthevar Rajasekaran and
Jop F. Sibeyn},
editor = {Lawrence Snyder},
title = {Matching the Bisection Bound for Routing and Sorting on the Mesh},
booktitle = {Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '92, San Diego, CA, USA, June 29 - July
1, 1992},
pages = {31--40},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/140901.140905},
doi = {10.1145/140901.140905},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/KaufmannRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/KaufmannS92,
author = {Michael Kaufmann and
Jop F. Sibeyn},
title = {Deterministic Routing on Circular Arrays},
booktitle = {Proceedings of the Fourth {IEEE} Symposium on Parallel and Distributed
Processing, {SPDP} 1992, Arlington, Texas, USA, December 1-4, 1992},
pages = {376--383},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SPDP.1992.242721},
doi = {10.1109/SPDP.1992.242721},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spdp/KaufmannS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaufmannMV92,
author = {Michael Kaufmann and
Paul Molitor and
Wolfgang Vogelgesang},
editor = {Alain Finkel and
Matthias Jantzen},
title = {Performance Driven k-Layer Wiring},
booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer
Science, Cachan, France, February 13-15, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {577},
pages = {489--500},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55210-3\_207},
doi = {10.1007/3-540-55210-3\_207},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KaufmannMV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaufmannS92,
author = {Michael Kaufmann and
Jop F. Sibeyn},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Optimal Multi-Packet Routing on the Torus},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {118--129},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_11},
doi = {10.1007/3-540-55706-7\_11},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaufmannS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/KaufmannM91,
author = {Michael Kaufmann and
Paul Molitor},
title = {Minimal stretching of a layout to ensure 2-layer wirability},
journal = {Integr.},
volume = {12},
number = {3},
pages = {339--352},
year = {1991},
url = {https://doi.org/10.1016/0167-9260(91)90029-K},
doi = {10.1016/0167-9260(91)90029-K},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/integration/KaufmannM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HoffmanKK91,
author = {Frank Hoffmann and
Michael Kaufmann and
Klaus Kriegel},
title = {The Art Gallery Theorem for Polygons With Holes},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {39--48},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185346},
doi = {10.1109/SFCS.1991.185346},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HoffmanKK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isa/KaufmannK91,
author = {Michael Kaufmann and
Gerhard Kl{\"{a}}r},
editor = {Wen{-}Lian Hsu and
Richard C. T. Lee},
title = {A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs},
booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
Republic of China, December 16-18, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {557},
pages = {336--348},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54945-5\_78},
doi = {10.1007/3-540-54945-5\_78},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/isa/KaufmannK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/Kaufmann90,
author = {Michael Kaufmann},
title = {A linear-time algorithm for routing in a convex grid},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {9},
number = {2},
pages = {180--184},
year = {1990},
url = {https://doi.org/10.1109/43.46784},
doi = {10.1109/43.46784},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/Kaufmann90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltFKMNSU90,
author = {Helmut Alt and
Rudolf Fleischer and
Michael Kaufmann and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Stefan Schirra and
Christian Uhrig},
editor = {Raimund Seidel},
title = {Approximate Motion Planning and the Complexity of the Boundary of
the Union of Simple Geometric Figures},
booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry,
Berkeley, CA, USA, June 6-8, 1990},
pages = {281--289},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/98524.98592},
doi = {10.1145/98524.98592},
timestamp = {Mon, 14 Jun 2021 16:24:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltFKMNSU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conpar/EklundK90,
author = {Patrik Eklund and
Michael Kaufmann},
editor = {Helmar Burkhart},
title = {Hierarchical Wiring in Multigrids},
booktitle = {{CONPAR} 90 - {VAPP} IV, Joint International Conference on Vector
and Parallel Processing, Zurich, Switzerland, September 10-13, 1990,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {457},
pages = {423--434},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53065-7\_121},
doi = {10.1007/3-540-53065-7\_121},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/conpar/EklundK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FormannHHKLSWW90,
author = {Michael Formann and
Torben Hagerup and
James Haralambides and
Michael Kaufmann and
Frank Thomson Leighton and
Antonios Symvonis and
Emo Welzl and
Gerhard J. Woeginger},
title = {Drawing Graphs in the Plane with High Resolution},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {86--95},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89527},
doi = {10.1109/FSCS.1990.89527},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FormannHHKLSWW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forum/Kaufmann90,
author = {Michael Kaufmann},
editor = {Hans{-}J{\"{u}}rgen Friemel and
Gisbert M{\"{u}}ller{-}Sch{\"{o}}nberger and
Andreas Sch{\"{u}}tt},
title = {Zur Physik des Fusionsreaktors. Neue Ergebnisse},
booktitle = {Forum '90 Wissenschaft und Technik, Neue Anwendungen mit Hilfe aktueller
Computer-Technologien, Trier 8./9. Oktober 1990, Proceedings},
series = {Informatik-Fachberichte},
volume = {259},
pages = {482--499},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/978-3-642-76123-2\_30},
doi = {10.1007/978-3-642-76123-2\_30},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/forum/Kaufmann90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/Kaufmann90,
author = {Michael Kaufmann},
title = {Allowing overlaps makes switchbox layouts nice},
booktitle = {Proceedings of the Second {IEEE} Symposium on Parallel and Distributed
Processing, {SPDP} 1990, Dallas, Texas, USA, December 9-13, 1990},
pages = {267--274},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/SPDP.1990.143546},
doi = {10.1109/SPDP.1990.143546},
timestamp = {Wed, 09 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spdp/Kaufmann90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HoffmannK90,
author = {Frank Hoffmann and
Michael Kaufmann},
editor = {Rolf H. M{\"{o}}hring},
title = {On the Rectilinear Art Gallery Problem - Algorithmic Aspects},
booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
{WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {484},
pages = {239--250},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53832-1\_46},
doi = {10.1007/3-540-53832-1\_46},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/wg/HoffmannK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GaoKM89,
author = {Shaodi Gao and
Michael Kaufmann and
F. Miller Maley},
editor = {Frank Thomson Leighton},
title = {Advances in Homotopic Layout Compaction},
booktitle = {Proceedings of the {ACM} Symposium on Parallel Algorithms and Architectures,
{SPAA} '89, Santa Fe, New Mexico, USA, June 18-21, 1989},
pages = {273--282},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/72935.72964},
doi = {10.1145/72935.72964},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GaoKM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/awoc/KaufmannT88,
author = {Michael Kaufmann and
Ioannis G. Tollis},
editor = {John H. Reif},
title = {Channel Routing with Short Wires},
booktitle = {{VLSI} Algorithms and Architectures, 3rd Aegean Workshop on Computing,
{AWOC} 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {319},
pages = {226--236},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0040390},
doi = {10.1007/BFB0040390},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/awoc/KaufmannT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cga/GaoKMRSJ88,
author = {Shaodi Gao and
Michael Kaufmann and
Kurt Mehlhorn and
Wolfgang R{\"{u}}lling and
Christoph Storb and
Mark Jerrum},
editor = {Hartmut Noltemeier},
title = {On Continuous Homotopic One Layer Routing},
booktitle = {Computational Geometry and its Applications, CG'88, International
Workshop on Computational Geometry, W{\"{u}}rzburg, Germany,
March 24-25, 1988},
series = {Lecture Notes in Computer Science},
volume = {333},
pages = {55--70},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-50335-8\_24},
doi = {10.1007/3-540-50335-8\_24},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/cga/GaoKMRSJ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GaoJKMR89,
author = {Shaodi Gao and
Mark Jerrum and
Michael Kaufmann and
Kurt Mehlhorn and
Wolfgang R{\"{u}}lling},
editor = {Herbert Edelsbrunner},
title = {On Continuous Homotopic One Layer Routing},
booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
Urbana-Champaign, IL, USA, June 6-8, 1988},
pages = {392--402},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/73393.73433},
doi = {10.1145/73393.73433},
timestamp = {Mon, 14 Jun 2021 16:25:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GaoJKMR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Kaufmann87a,
author = {Michael Kaufmann},
title = {{\"{U}}ber Lokales Verdrahten von Zwei-Punkt-Netzen},
school = {Saarland University, Saarbr{\"{u}}cken, Germany},
year = {1987},
url = {https://d-nb.info/881482234},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Kaufmann87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaoK87,
author = {Shaodi Gao and
Michael Kaufmann},
title = {Channel Routing of Multiterminal Nets},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {316--325},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.13},
doi = {10.1109/SFCS.1987.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GaoK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaufmannM87,
author = {Michael Kaufmann and
Kurt Mehlhorn},
editor = {Franz{-}Josef Brandenburg and
Guy Vidal{-}Naquet and
Martin Wirsing},
title = {On Local Routing of Two-Terminal Nets},
booktitle = {{STACS} 87, 4th Annual Symposium on Theoretical Aspects of Computer
Science, Passau, Germany, February 19-21, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {247},
pages = {40--52},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/BFb0039593},
doi = {10.1007/BFB0039593},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KaufmannM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KaufmannM86,
author = {Michael Kaufmann and
Kurt Mehlhorn},
title = {Routing Through a Generalized Switchbox},
journal = {J. Algorithms},
volume = {7},
number = {4},
pages = {510--531},
year = {1986},
url = {https://doi.org/10.1016/0196-6774(86)90016-7},
doi = {10.1016/0196-6774(86)90016-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KaufmannM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaufmannM85,
author = {Michael Kaufmann and
Kurt Mehlhorn},
editor = {Wilfried Brauer},
title = {Routing Through a Generalized Switchbox},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {328--337},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015758},
doi = {10.1007/BFB0015758},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KaufmannM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/Kaufmann84,
author = {Michael Kaufmann},
editor = {Bruno Courcelle},
title = {Nearly Tight Bounds for the Longest Edge in an Tree in a {VLSI} Lay
Out},
booktitle = {CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux,
France, March 5-7, 1984, Proceedings},
pages = {169--180},
publisher = {Cambridge University Press},
year = {1984},
timestamp = {Wed, 09 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caap/Kaufmann84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-01-27 23:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
