default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Bläsius
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
- affiliation (former): Hasso Plattner Institute, Potsdam, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Tobias Bleifuß
, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann:
Discovering Functional Dependencies through Hitting Set Enumeration. Proc. ACM Manag. Data 2(1): 43:1-43:24 (2024)- [j25]Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-case Analyses of Graph Algorithms. ACM Trans. Algorithms 20(1): 10:1-10:42 (2024) - [d1]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). Zenodo, 2024
- [i41]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR abs/2402.05534 (2024) - [i40]Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen:
Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR abs/2407.09362 (2024) - [i39]Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas:
Weighted Embeddings for Low-Dimensional Graph Representation. CoRR abs/2410.06042 (2024) - [i38]Thomas Bläsius, Max Göttlicher, Sascha Gritzbach, Wendy Yi:
The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. CoRR abs/2410.15031 (2024) - [i37]Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Uniform Sampling of Negative Edge Weights in Shortest Path Networks. CoRR abs/2410.22717 (2024) - 2023
- [j24]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85(12): 3487-3520 (2023) - [j23]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. 108: 101902 (2023) - [j22]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67(1): 28-51 (2023) - [j21]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63(4): 885-941 (2023) - [j20]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19(4): 34:1-34:23 (2023) - [c46]Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. CIAC 2023: 142-156 - [c45]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA 2023: 20:1-20:13 - [c44]Thomas Bläsius, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. ESA 2023: 21:1-21:15 - [c43]Thomas Bläsius, Marcus Wilhelm:
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. IWOCA 2023: 99-110 - [c42]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Strongly Hyperbolic Unit Disk Graphs. STACS 2023: 13:1-13:17 - [c41]Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition into Cliques. SEA 2023: 3:1-3:19 - [i36]Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut:
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR abs/2301.05550 (2023) - [i35]Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. CoRR abs/2302.07657 (2023) - [i34]Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR abs/2302.08870 (2023) - [i33]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR abs/2306.09506 (2023) - [i32]Thomas Bläsius, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. CoRR abs/2306.09870 (2023) - [i31]Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis:
Maximal Cliques in Scale-Free Random Graphs. CoRR abs/2309.02990 (2023) - 2022
- [j19]Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124: 192-213 (2022) - [j18]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - [j17]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms 18(2): 19:1-19:32 (2022) - [j16]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. 900: 79-96 (2022) - [c40]Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - [c39]Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. ESA 2022: 21:1-21:14 - [c38]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - [i30]Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. CoRR abs/2205.15066 (2022) - [i29]Thomas Bläsius, Marcus Wilhelm:
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. CoRR abs/2209.15300 (2022) - 2021
- [c37]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA 2021: 19:1-19:14 - [c36]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA 2021: 20:1-20:15 - [c35]Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. ESA 2021: 21:1-21:14 - [c34]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC 2021: 29:1-29:17 - [c33]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - [c32]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - [c31]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA 2021: 42-53 - [c30]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA 2021: 22:1-22:18 - [i28]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. CoRR abs/2102.09856 (2021) - [i27]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR abs/2103.13331 (2021) - [i26]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR abs/2107.05518 (2021) - [i25]Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. CoRR abs/2110.11697 (2021) - 2020
- [j15]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25: 1-18 (2020) - [j14]Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck:
Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. 13(11): 2270-2283 (2020) - [c29]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:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS 2020: 10:1-10:14 - [c28]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. ESA 2020: 21:1-21:15 - [c27]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS 2020: 25:1-25:14 - [i24]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR abs/2004.07319 (2020) - [i23]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR abs/2007.15362 (2020) - [i22]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:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR abs/2008.10316 (2020) - [i21]Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR abs/2009.09678 (2020) - [i20]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/2010.02787 (2020)
2010 – 2019
- 2019
- [j13]Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. J. Graph Algorithms Appl. 23(4): 653-682 (2019) - [c26]Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX 2019: 130-143 - [c25]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA 2019: 21:1-21:14 - [c24]Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton:
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) 2019: 117-134 - [c23]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW 2019: 87-101 - [i19]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR abs/1904.12503 (2019) - [i18]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR abs/1905.06706 (2019) - [i17]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR abs/1905.12477 (2019) - [i16]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. CoRR abs/1910.00308 (2019) - 2018
- [j12]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 80(4): 1214-1277 (2018) - [j11]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Cliques in Hyperbolic Random Graphs. Algorithmica 80(8): 2324-2344 (2018) - [j10]Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt:
Local and union boxicity. Discret. Math. 341(5): 1307-1315 (2018) - [j9]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable exact visualization of isocontours in road networks via minimum-link paths. J. Comput. Geom. 9(1): 27-73 (2018) - [j8]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. 26(2): 920-933 (2018) - [c22]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX 2018: 199-208 - [c21]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP 2018: 20:1-20:14 - [c20]Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann:
Memory-Restricted Routing with Tiled Map Data. SMC 2018: 3347-3354 - [c19]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel:
Towards a Systematic Evaluation of Generative Network Models. WAW 2018: 99-114 - [i15]Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck:
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR abs/1805.01310 (2018) - [i14]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/1805.03253 (2018) - 2017
- [c18]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:
TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers. CHI 2017: 2606-2616 - [c17]Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. SOFSEM 2017: 295-308 - [c16]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:
Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures. UIST (Adjunct Volume) 2017: 43-45 - 2016
- [j7]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal graph drawing with inflexible edges. Comput. Geom. 55: 26-40 (2016) - [j6]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. ACM Trans. Algorithms 12(2): 16:1-16:46 (2016) - [j5]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms 12(3): 33:1-33:32 (2016) - [j4]Thomas Bläsius, Ignaz Rutter:
A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609: 306-315 (2016) - [c15]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. ESA 2016: 7:1-7:18 - [c14]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Hyperbolic Random Graphs: Separators and Treewidth. ESA 2016: 15:1-15:16 - [c13]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA 2016: 16:1-16:18 - [c12]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC 2016: 6:1-6:13 - [i13]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. CoRR abs/1602.01777 (2016) - [i12]Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt:
Local and Union Boxicity. CoRR abs/1609.09447 (2016) - 2015
- [b1]Thomas Bläsius:
New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity. Karlsruhe Institute of Technology, 2015 - [j3]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6): 459-478 (2015) - [c11]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal Graph Drawing with Inflexible Edges. CIAC 2015: 61-73 - [c10]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. GD 2015: 472-486 - [p1]Thomas Bläsius:
Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität. Ausgezeichnete Informatikdissertationen 2015: 21-30 - [i11]Thomas Bläsius, Ignaz Rutter:
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. CoRR abs/1506.05673 (2015) - [i10]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. CoRR abs/1506.05715 (2015) - [i9]Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. CoRR abs/1507.01450 (2015) - 2014
- [j2]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 68(4): 859-885 (2014) - [j1]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. 24(4): 325-346 (2014) - [c9]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA 2014: 161-172 - [c8]Thomas Bläsius, Ignaz Rutter:
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. GD 2014: 440-451 - [i8]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal Graph Drawing with Inflexible Edges. CoRR abs/1404.2943 (2014) - [i7]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR abs/1405.2300 (2014) - 2013
- [c7]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. GD 2013: 220-231 - [c6]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD 2013: 460-471 - [c5]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) 2013: 184-195 - [c4]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. ISAAC 2013: 350-360 - [c3]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. SODA 2013: 1030-1043 - [r1]Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter:
Simultaneous Embedding of Planar Graphs. Handbook of Graph Drawing and Visualization 2013: 349-381 - [i6]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. CoRR abs/1303.1640 (2013) - [i5]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR abs/1308.6778 (2013) - 2012
- [c2]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and Relative Positions in Simultaneous Embeddings. GD 2012: 31-42 - [i4]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and Relative Positions in Simultaneous Embeddings. CoRR abs/1204.2903 (2012) - [i3]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. CoRR abs/1204.4997 (2012) - [i2]Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter:
Simultaneous Embedding of Planar Graphs. CoRR abs/1204.5853 (2012) - 2011
- [i1]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. CoRR abs/1112.0245 (2011) - 2010
- [c1]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. GD 2010: 92-104
Coauthor Index
[d1] [i41] [j24] [j23] [j22] [j21] [c45] [c42] [i33] [j19] [j18] [j17] [j16] [c40] [c36] [c35] [c34] [c31] [c30] [i28] [i27] [i26] [i25] [j15] [j14] [c29] [c28] [c27] [i24] [i22] [i21] [i20] [c26] [c25] [c24] [c23] [i19] [i18] [i17] [i16] [j11] [j8] [c22] [c21] [c20] [c19] [i15] [i14] [c14] [c13] [c12]
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:07 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:
