Thomas Bläsius

130 papers A* 6A 25B 10C 7Journal 76Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Deterministic performance guarantees for bidirectional BFS on real-world networks. J. Comput. Syst. Sci. Thomas Bläsius, Marcus Wilhelm
2026	J	`jnl`	Diameter Computation on (Random) Geometric Graphs. CoRR Thomas Bläsius, Annemarie Schaub, Marcus Wilhelm
2026	J	`jnl`	Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs. CoRR Thomas Bläsius, Emil Dohse, Deborah Haun, Laura Merker
2025	J	`jnl`	An Efficient Algorithm for Power Dominating Set. Algorithmica Thomas Bläsius, Max Göttlicher
2025	J	`jnl`	Assortativity in geometric and scale-free networks. CoRR Marc Kaufmann, Ulysse Schaller, Thomas Bläsius, Johannes Lengler
2025	J	`jnl`	Customizable Contraction Hierarchies - A Survey. CoRR Thomas Bläsius, Valentin Buchhold, Dorothea Wagner, Tim Zeitz, Michael Zündorf
2025	J	`jnl`	Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem. CoRR Thomas Bläsius, Henrik Csöre, Max Göttlicher, Elly Schmidt, Wendy Yi
2025	C	`conf`	Separator-Based Alternative Paths in Customizable Contraction Hierarchies. ATMOS Scott Bacherle, Thomas Bläsius, Michael Zündorf
2025	A*	`conf`	Structure and Independence in Hyperbolic Uniform Disk Graphs. SoCG Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
2025	A	`conf`	Synergistic Traffic Assignment. AAMAS Thomas Bläsius, Adrian Feilhauer, Markus Jung, Moritz Laupichler, Peter Sanders, Michael Zündorf
2025	J	`jnl`	Synergistic Traffic Assignment. CoRR Thomas Bläsius, Adrian Feilhauer, Markus Jung, Moritz Laupichler, Peter Sanders, Michael Zündorf
2025	A	`conf`	The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. ALENEX Thomas Bläsius, Max Göttlicher, Sascha Gritzbach, Wendy Yi
2025	A*	`conf`	Weighted Embeddings for Low-Dimensional Graph Representation. AAAI Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas
2024	J	`jnl`	Discovering Functional Dependencies through Hitting Set Enumeration. Proc. ACM Manag. Data Tobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann
2024	J	`jnl`	Maximal cliques in scale-free random graphs. Netw. Sci. Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis
2024	J	`jnl`	On the External Validity of Average-case Analyses of Graph Algorithms. ACM Trans. Algorithms Thomas Bläsius, Philipp Fischbeck
2024	J	`jnl`	Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca
2024	J	`jnl`	Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
2024	J	`jnl`	The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. CoRR Thomas Bläsius, Max Göttlicher, Sascha Gritzbach, Wendy Yi
2024	J	`jnl`	Uniform Sampling of Negative Edge Weights in Shortest Path Networks. CoRR Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran
2024	J	`jnl`	Weighted Embeddings for Low-Dimensional Graph Representation. CoRR Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas
2023	A	`conf`	An Efficient Algorithm for Power Dominating Set. ESA Thomas Bläsius, Max Göttlicher
2023	J	`jnl`	An Efficient Algorithm for Power Dominating Set. CoRR Thomas Bläsius, Max Göttlicher
2023	C	`conf`	Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. IWOCA Thomas Bläsius, Marcus Wilhelm
2023	C	`conf`	Dynamic Flows with Time-Dependent Capacities. CIAC Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder
2023	J	`jnl`	Dynamic Flows with Time-Dependent Capacities. CoRR Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder
2023	J	`jnl`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2023	J	`jnl`	Maximal Cliques in Scale-Free Random Graphs. CoRR Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis
2023	A	`conf`	On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
2023	J	`jnl`	On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
2023	J	`jnl`	Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
2023	B	`conf`	Partitioning the Bags of a Tree Decomposition into Cliques. SEA Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
2023	J	`jnl`	Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut
2023	J	`jnl`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2023	A	`conf`	Strongly Hyperbolic Unit Disk Graphs. STACS Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
2023	J	`jnl`	Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2023	J	`jnl`	The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2023	J	`jnl`	The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2022	B	`conf`	A Branch-And-Bound Algorithm for Cluster Editing. SEA Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2022	A	`conf`	An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2022	J	`jnl`	Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. CoRR Thomas Bläsius, Marcus Wilhelm
2022	J	`jnl`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2022	J	`jnl`	Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2022	J	`jnl`	Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2022	A	`conf`	On the External Validity of Average-Case Analyses of Graph Algorithms. ESA Thomas Bläsius, Philipp Fischbeck
2022	J	`jnl`	On the External Validity of Average-Case Analyses of Graph Algorithms. CoRR Thomas Bläsius, Philipp Fischbeck
2022	J	`jnl`	The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	An Efficient Branch-and-Bound Solver for Hitting Set. CoRR Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2021	A	`conf`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2021	A	`conf`	Efficiently Computing Maximum Flows in Scale-Free Networks. ESA Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2021	B	`conf`	Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2021	B	`conf`	PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2021	B	`conf`	PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2021	J	`jnl`	Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
2021	A	`conf`	Synchronized Planarity with Applications to Constrained Planarity Problems. ESA Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2021	J	`jnl`	The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2021	B	`conf`	The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2021	A*	`conf`	The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2020	C	`conf`	A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger
2020	J	`jnl`	A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger
2020	J	`jnl`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2020	J	`jnl`	Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2020	J	`jnl`	Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck
2020	J	`jnl`	Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2020	A	`conf`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2020	J	`jnl`	Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2020	J	`jnl`	The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2020	A	`conf`	The Minimization of Random Hypergraphs. ESA Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2019	A	`conf`	Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2019	A	`conf`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	J	`jnl`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	J	`jnl`	How to Draw a Planarization. J. Graph Algorithms Appl. Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
2019	—	`conf`	On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton
2019	J	`jnl`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2019	J	`jnl`	The Minimization of Random Hypergraphs. CoRR Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2019	C	`conf`	Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
2019	J	`jnl`	Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
2018	J	`jnl`	Cliques in Hyperbolic Random Graphs. Algorithmica Thomas Bläsius, Tobias Friedrich, Anton Krohmer
2018	J	`jnl`	Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
2018	A*	`conf`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2018	J	`jnl`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2018	A	`conf`	Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2018	J	`jnl`	Local and union boxicity. Discret. Math. Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
2018	B	`conf`	Memory-Restricted Routing with Tiled Map Data. SMC Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann
2018	J	`jnl`	On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck
2018	J	`jnl`	Scalable exact visualization of isocontours in road networks via minimum-link paths. J. Comput. Geom. Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2018	J	`jnl`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica Thomas Bläsius, Annette Karrer, Ignaz Rutter
2018	C	`conf`	Towards a Systematic Evaluation of Generative Network Models. WAW Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
2017	—	`conf`	Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures. UIST (Adjunct Volume) Robert Kovacs, Ludwig Wall, Anna Seufert, Hsiang-Ting Chen, Willi Müller, Florian Meinel, Yannis Kommana, Thomas Bläsius, Oliver S. Schneider, Thijs Roumen, Patrick Baudisch
2017	B	`conf`	How to Draw a Planarization. SOFSEM Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
2017	A*	`conf`	TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers. CHI Robert Kovacs, Anna Seufert, Ludwig Wall, Hsiang-Ting Chen, Florian Meinel, Willi Müller, Sijing You, Maximilian Brehm, Jonathan Striebel, Yannis Kommana, Alexander Popiak, Thomas Bläsius, Patrick Baudisch
2016	J	`jnl`	A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. Thomas Bläsius, Ignaz Rutter
2016	A	`conf`	Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
2016	A	`conf`	Hyperbolic Random Graphs: Separators and Treewidth. ESA Thomas Bläsius, Tobias Friedrich, Anton Krohmer
2016	J	`jnl`	Local and Union Boxicity. CoRR Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
2016	J	`jnl`	Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2016	J	`jnl`	Orthogonal graph drawing with inflexible edges. Comput. Geom. Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2016	A	`conf`	Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. ESA Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016	J	`jnl`	Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. CoRR Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016	J	`jnl`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. ACM Trans. Algorithms Thomas Bläsius, Ignaz Rutter
2016	B	`conf`	The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2015	J	`jnl`	A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. CoRR Thomas Bläsius, Ignaz Rutter
2015	J	`jnl`	Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. Thomas Bläsius, Ignaz Rutter
2015	—	`ch.`	Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität. Ausgezeichnete Informatikdissertationen Thomas Bläsius
2015	—	`—`	New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity. Thomas Bläsius
2015	C	`conf`	Orthogonal Graph Drawing with Inflexible Edges. CIAC Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2015	A	`conf`	Pixel and Voxel Representations of Graphs. GD Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	J	`jnl`	Pixel and Voxel Representations of Graphs. CoRR Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	J	`jnl`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. CoRR Thomas Bläsius, Annette Karrer, Ignaz Rutter
2014	A	`conf`	A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. GD Thomas Bläsius, Ignaz Rutter
2014	A	`conf`	Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA Thomas Bläsius, Guido Brückner, Ignaz Rutter
2014	J	`jnl`	Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR Thomas Bläsius, Guido Brückner, Ignaz Rutter
2014	J	`jnl`	Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2014	J	`jnl`	Orthogonal Graph Drawing with Inflexible Edges. CoRR Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2014	J	`jnl`	Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	—	`conf`	Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2013	—	`ch.`	Simultaneous Embedding of Planar Graphs. Handbook of Graph Drawing and Visualization Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter
2013	A	`conf`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. GD Thomas Bläsius, Annette Karrer, Ignaz Rutter
2013	A*	`conf`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. SODA Thomas Bläsius, Ignaz Rutter
2013	J	`jnl`	Testing Mutual Duality of Planar Graphs CoRR Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	B	`conf`	Testing Mutual Duality of Planar Graphs. ISAAC Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	A	`conf`	Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2013	J	`jnl`	Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2012	J	`jnl`	Disconnectivity and Relative Positions in Simultaneous Embeddings CoRR Thomas Bläsius, Ignaz Rutter
2012	A	`conf`	Disconnectivity and Relative Positions in Simultaneous Embeddings. GD Thomas Bläsius, Ignaz Rutter
2012	J	`jnl`	Optimal Orthogonal Graph Drawing with Convex Bend Costs CoRR Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2012	J	`jnl`	Simultaneous Embedding of Planar Graphs CoRR Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter
2011	J	`jnl`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems CoRR Thomas Bläsius, Ignaz Rutter
2010	A	`conf`	Orthogonal Graph Drawing with Flexibility Constraints. GD Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner