| Publication | Date of Publication | Type |
|---|
| Orthogonal dissection into few rectangles | 2025-01-14 | Paper |
| Improved mixing for the convex polygon triangulation flip walk | 2024-11-14 | Paper |
| On the biplanarity of blowups | 2024-11-12 | Paper |
| Non-crossing Hamiltonian paths and cycles in output-polynomial time | 2024-10-16 | Paper |
| Manipulating weights to improve stress-graph drawings of 3-connected planar graphs | 2024-10-14 | Paper |
| Non-crossing Hamiltonian paths and cycles in output-polynomial time | 2024-10-07 | Paper |
| Product structure extension of the Alon-Seymour-Thomas theorem | 2024-07-16 | Paper |
| The complexity of iterated reversible computation | 2024-07-03 | Paper |
| Finding relevant points for nearest-neighbor classification | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| Lower bounds for non-adaptive shortest path relaxation | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179337 | 2023-12-16 | Paper |
| Simplifying Activity-On-Edge Graphs | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059174 | 2023-11-02 | Paper |
| Quasipolynomiality of the Smallest Missing Induced Subgraph | 2023-09-20 | Paper |
| The Widths of Strict Outerconfluent Graphs | 2023-08-07 | Paper |
| Angles of arc-polygons and lombardi drawings of cacti | 2023-06-26 | Paper |
| Geometric Graphs with Unbounded Flip-Width | 2023-06-21 | Paper |
| A stronger lower bound on parametric minimum spanning trees | 2023-06-05 | Paper |
| The centroid of points with approximate weights | 2023-05-08 | Paper |
| On the treewidth of Hanoi graphs | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875621 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875617 | 2023-02-03 | Paper |
| C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. | 2023-02-03 | Paper |
| On the Biplanarity of Blowups | 2023-01-22 | Paper |
| Parallel construction of quadtrees and quality triangulations | 2023-01-18 | Paper |
| Using sparsification for parametric minimum spanning tree problems | 2022-12-09 | Paper |
| Finding the k smallest spanning trees | 2022-12-09 | Paper |
| Geometric dominating sets -- a minimum version of the no-three-in-line problem | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104352 | 2022-09-09 | Paper |
| An efficient algorithm for shortest paths in vertical and horizontal segments | 2022-08-19 | Paper |
| Improved mixing for the convex polygon triangulation flip walk | 2022-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088963 | 2022-07-18 | Paper |
| Cubic Planar Graphs that cannot be Drawn on few Lines | 2022-07-18 | Paper |
| Limitations on realistic hyperbolic graph drawing | 2022-07-01 | Paper |
| Stack-number is not bounded by queue-number | 2022-06-30 | Paper |
| Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings | 2022-06-28 | Paper |
| The graphs of stably matchable pairs | 2022-06-08 | Paper |
| Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes | 2022-05-20 | Paper |
| Algorithms for Stable Matching and Clustering in a Grid | 2022-05-18 | Paper |
| Cubic Planar Graphs that cannot be Drawn on few Lines | 2022-05-13 | Paper |
| Ununfoldable polyhedra with \(6\) vertices or \(6\) faces | 2022-04-08 | Paper |
| A stronger lower bound on parametric minimum spanning trees | 2022-03-25 | Paper |
| Geometric Dominating Sets | 2022-03-24 | Paper |
| On the treewidth of Hanoi graphs | 2022-02-21 | Paper |
| Three-dimensional graph products with unbounded stack-number | 2022-02-10 | Paper |
| Egyptian Fractions with Denominators from Sequences Closed Under Doubling | 2021-10-05 | Paper |
| Parameterized Leaf Power Recognition via Embedding into Graph Products | 2021-08-04 | Paper |
| The Parameterized Complexity of Finding Point Sets with Hereditary Properties | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002769 | 2021-07-28 | Paper |
| On polyhedral realization with isosceles triangles | 2021-07-28 | Paper |
| C-planarity testing of embedded clustered graphs with bounded dual carving-width | 2021-07-26 | Paper |
| NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs | 2021-06-22 | Paper |
| Grid peeling and the affine curve-shortening flow | 2021-04-01 | Paper |
| Counting polygon triangulations is hard | 2021-01-29 | Paper |
| Approximate Greedy Clustering and Distance Selection for Graph Metrics | 2021-01-12 | Paper |
| Face flips in origami tessellations | 2020-11-12 | Paper |
| Stack-number is not bounded by queue-number | 2020-11-09 | Paper |
| Existence and hardness of conveyor belts | 2020-11-05 | Paper |
| Minor-Closed Graph Classes with Bounded Layered Pathwidth | 2020-10-28 | Paper |
| Homotopy height, grid-major height and graph-drawing height | 2020-10-26 | Paper |
| Treetopes and their graphs | 2020-09-01 | Paper |
| Parameterized leaf power recognition via embedding into graph products | 2020-08-12 | Paper |
| Faster Evaluation of Subtraction Games | 2020-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3301008 | 2020-08-11 | Paper |
| Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms | 2020-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111875 | 2020-05-27 | Paper |
| On the treewidth of Hanoi graphs | 2020-04-30 | Paper |
| Reactive proximity data structures for graphs | 2020-02-12 | Paper |
| Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
| Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection | 2019-10-24 | Paper |
| Randomized Speedup of the Bellman–Ford Algorithm | 2019-09-17 | Paper |
| Small Superpatterns for Dominance Drawing | 2019-09-17 | Paper |
| Grid peeling and the affine curve-shortening flow | 2019-09-12 | Paper |
| Realization and Connectivity of the Graphs of Origami Flat Foldings | 2019-09-10 | Paper |
| Covering many points with a small-area box | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967175 | 2019-07-03 | Paper |
| Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633822 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633821 | 2019-05-06 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2019-04-25 | Paper |
| Track layouts, layered path decompositions, and leveled planarity | 2019-04-25 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2019-02-27 | Paper |
| Flat foldings of plane graphs with prescribed angles and edge lengths | 2019-02-27 | Paper |
| Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count | 2019-02-20 | Paper |
| The Effect of Planarization on Width | 2019-02-20 | Paper |
| Realization and connectivity of the graphs of origami flat foldings | 2019-02-15 | Paper |
| Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth | 2019-01-18 | Paper |
| Spanning trees in multipartite geometric graphs | 2019-01-11 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| Vertex-unfoldings of simplicial manifolds | 2018-11-23 | Paper |
| Subexponential-time and FPT algorithms for embedded flat clustered planarity | 2018-11-22 | Paper |
| The Parametric Closure Problem | 2018-11-12 | Paper |
| Testing bipartiteness of geometric intersection graphs | 2018-11-05 | Paper |
| Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs | 2018-10-25 | Paper |
| The Effect of Planarization on Width | 2018-10-25 | Paper |
| Models and algorithms for graph watermarking | 2018-10-18 | Paper |
| Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect | 2018-10-04 | Paper |
| Treetopes and their Graphs | 2018-07-16 | Paper |
| Forbidden Configurations in Discrete Geometry | 2018-06-27 | Paper |
| Maximizing the Sum of Radii of Disjoint Balls or Disks | 2018-06-05 | Paper |
| From discrepancy to majority | 2018-05-23 | Paper |
| On the planar split thickness of graphs | 2018-04-11 | Paper |
| All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs | 2018-01-30 | Paper |
| Parameterized Complexity of 1-Planarity | 2018-01-12 | Paper |
| The skip quadtree | 2017-10-20 | Paper |
| Minimum dilation stars | 2017-10-20 | Paper |
| Area-universal rectangular layouts | 2017-10-20 | Paper |
| Cuckoo Filter: Simplification and Analysis | 2017-10-17 | Paper |
| Finding All Maximal Subsequences with Hereditary Properties | 2017-10-10 | Paper |
| Minimum Forcing Sets for Miura Folding Patterns | 2017-10-05 | Paper |
| The geometric thickness of low degree graphs | 2017-09-29 | Paper |
| Optimized color gamuts for tiled displays | 2017-09-29 | Paper |
| Deterministic sampling and range counting in geometric data streams | 2017-09-29 | Paper |
| Multivariate regression depth | 2017-09-29 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2017-09-22 | Paper |
| Succinct Greedy Geometric Routing Using Hyperbolic Geometry | 2017-07-27 | Paper |
| Rooted Cycle Bases | 2017-07-13 | Paper |
| Listing All Maximal Cliques in Large Sparse Real-World Graphs | 2017-06-16 | Paper |
| Structure of Graphs with Locally Restricted Crossings | 2017-05-24 | Paper |
| Rigid Origami Vertices: Conditions and Forcing Sets | 2017-03-30 | Paper |
| Adjacency-preserving spatial treemaps | 2017-03-30 | Paper |
| Strict Confluent Drawing | 2017-03-30 | Paper |
| Happy endings for flip graphs | 2017-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968080 | 2017-03-09 | Paper |
| Steinitz Theorems for Orthogonal Polyhedra | 2017-03-09 | Paper |
| Track Layout Is Hard | 2017-02-21 | Paper |
| Genus, Treewidth, and Local Crossing Number | 2017-02-10 | Paper |
| Simple Recognition of Halin Graphs and Their Generalizations | 2016-07-05 | Paper |
| Dynamic connectivity in digital images | 2016-06-01 | Paper |
| Distance-sensitive planar point location | 2016-05-17 | Paper |
| On the planar split thickness of graphs | 2016-05-03 | Paper |
| From Discrepancy to Majority | 2016-05-03 | Paper |
| Folding a paper strip to minimize thickness | 2016-02-18 | Paper |
| Ramified rectilinear polygons: coordinatization by dendrons | 2016-02-03 | Paper |
| Near-linear-time deterministic plane Steiner spanners for well-spaced point sets | 2016-01-29 | Paper |
| The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings | 2016-01-07 | Paper |
| Improved Grid Map Layout by Point Set Matching | 2015-11-03 | Paper |
| The Parametric Closure Problem | 2015-10-30 | Paper |
| Rooted Cycle Bases | 2015-10-30 | Paper |
| Contact Graphs of Circular Arcs | 2015-10-30 | Paper |
| Linear-Time Algorithms for Proportional Apportionment | 2015-09-11 | Paper |
| Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms | 2015-09-02 | Paper |
| Deterministic sampling and range counting in geometric data streams | 2015-09-02 | Paper |
| Metric Dimension Parameterized by Max Leaf Number | 2015-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501831 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501789 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501348 | 2015-08-03 | Paper |
| Quasiconvex Analysis of Backtracking Algorithms | 2015-08-03 | Paper |
| Planar Induced Subgraphs of Sparse Graphs | 2015-05-18 | Paper |
| Separator based sparsification for dynamic planar graph algorithms | 2015-05-07 | Paper |
| Skip-webs | 2015-03-10 | Paper |
| Folding a Paper Strip to Minimize Thickness | 2015-02-27 | Paper |
| The graphs of planar soap bubbles | 2015-02-17 | Paper |
| Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth | 2015-01-07 | Paper |
| Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths | 2015-01-07 | Paper |
| Planar Induced Subgraphs of Sparse Graphs | 2015-01-07 | Paper |
| Balanced Circle Packings for Planar Graphs | 2015-01-07 | Paper |
| The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934579 | 2014-12-18 | Paper |
| Squarepants in a tree, sum of subtree clustering and hyperbolic pants decomposition | 2014-11-18 | Paper |
| Squarepants in a tree | 2014-11-18 | Paper |
| All maximal independent sets and dynamic dominance for sparse graphs | 2014-11-18 | Paper |
| A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing | 2014-11-14 | Paper |
| All maximal independent sets and dynamic dominance for sparse graphs | 2014-10-13 | Paper |
| Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket | 2014-09-30 | Paper |
| Grid minors in damaged grids | 2014-09-04 | Paper |
| Antimatroids and balanced pairs | 2014-06-12 | Paper |
| Universal Point Sets for Drawing Planar Graphs with Circular Arcs | 2014-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417691 | 2014-05-22 | Paper |
| Superpatterns and Universal Point Sets | 2014-05-22 | Paper |
| Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity | 2014-05-22 | Paper |
| Steinitz Theorems for Orthogonal Polyhedra | 2014-04-03 | Paper |
| Bounds on the complexity of halfspace intersections when the bounded faces have small dimension | 2014-03-24 | Paper |
| On 2-site Voronoi diagrams under geometric distance functions | 2014-02-06 | Paper |
| Drawing Arrangement Graphs in Small Grids, or How to Play Planarity | 2013-12-20 | Paper |
| Fixed Parameter Tractability of Crossing Minimization of Almost-Trees | 2013-12-20 | Paper |
| Superpatterns and Universal Point Sets | 2013-12-20 | Paper |
| Strict Confluent Drawing | 2013-12-20 | Paper |
| Category-based routing in social networks: membership dimension and the small-world phenomenon | 2013-12-11 | Paper |
| Confluent Hasse diagrams | 2013-11-28 | Paper |
| Optimal angular resolution for face-symmetric drawings | 2013-11-28 | Paper |
| Parameterized Complexity of 1-Planarity | 2013-08-12 | Paper |
| Combinatorial Pair Testing: Distinguishing Workers from Slackers | 2013-08-12 | Paper |
| Bounds on the complexity of halfspace intersections when the bounded faces have small dimension | 2013-08-05 | Paper |
| Optimal 3D Angular Resolution for Low-Degree Graphs | 2013-04-09 | Paper |
| Flows in One-Crossing-Minor-Free Graphs | 2013-04-09 | Paper |
| Planar Lombardi Drawings for Subcubic Graphs | 2013-04-03 | Paper |
| On the Density of Maximal 1-Planar Graphs | 2013-04-03 | Paper |
| Force-Directed Graph Drawing Using Social Gravity and Scaling | 2013-04-03 | Paper |
| Drawing trees with perfect angular resolution and polynomial area | 2013-03-20 | Paper |
| The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing | 2013-03-19 | Paper |
| Inapproximability of Orthogonal Compaction | 2012-12-07 | Paper |
| The h-Index of a Graph and its Application to Dynamic Subgraph Statistics | 2012-12-04 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2012-12-04 | Paper |
| Area-universal and constrained rectangular layouts | 2012-09-12 | Paper |
| Extended dynamic subgraph statistics using \(h\)-index parameterized data structures | 2012-08-13 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2012-03-09 | Paper |
| Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings | 2012-03-09 | Paper |
| Confluent Hasse Diagrams | 2012-03-09 | Paper |
| Lombardi Drawings of Graphs | 2012-01-12 | Paper |
| Adjacency-Preserving Spatial Treemaps | 2011-08-12 | Paper |
| Tracking Moving Objects with Few Handovers | 2011-08-12 | Paper |
| Combinatorics and Geometry of Finite and Infinite Squaregraphs | 2011-07-18 | Paper |
| The Fibonacci dimension of a graph | 2011-06-01 | Paper |
| Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings | 2011-04-04 | Paper |
| APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS | 2011-03-25 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2011-02-11 | Paper |
| Drawing Trees with Perfect Angular Resolution and Polynomial Area | 2011-02-11 | Paper |
| Optimal 3D Angular Resolution for Low-Degree Graphs | 2011-02-11 | Paper |
| Lombardi Drawings of Graphs | 2011-02-11 | Paper |
| Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures | 2011-01-08 | Paper |
| Densities of minor-closed graph families | 2010-12-16 | Paper |
| Flows in One-Crossing-Minor-Free Graphs | 2010-12-09 | Paper |
| Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time | 2010-12-09 | Paper |
| Cloning Voronoi Diagrams via Retroactive Data Structures | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579509 | 2010-08-06 | Paper |
| Approximate Weighted Farthest Neighbors and Minimum Dilation Stars | 2010-07-20 | Paper |
| Regular Labelings and Geometric Structures | 2010-07-01 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Graph-Theoretic Solutions to Computational Geometry Problems | 2010-01-21 | Paper |
| Manhattan orbifolds | 2009-12-15 | Paper |
| On verifying and engineering the wellgradedness of a union-closed family | 2009-12-07 | Paper |
| Finding Large Clique Minors is Hard | 2009-10-21 | Paper |
| On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem | 2009-10-20 | Paper |
| The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics | 2009-10-20 | Paper |
| Orientation-Constrained Rectangular Layouts | 2009-10-20 | Paper |
| Optimal Embedding into Star Metrics | 2009-10-20 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Edges and switches, tunnels and bridges | 2009-06-30 | Paper |
| Isometric Diamond Subgraphs | 2009-03-03 | Paper |
| Succinct Greedy Graph Drawing in the Hyperbolic Plane | 2009-03-03 | Paper |
| The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing | 2009-03-03 | Paper |
| Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters | 2009-02-17 | Paper |
| Edges and Switches, Tunnels and Bridges | 2009-02-17 | Paper |
| Happy endings for flip graphs | 2009-02-12 | Paper |
| Guard placement for efficient point-in-polygon proofs | 2009-02-12 | Paper |
| Upright-Quad Drawing of st-Planar Learning Spaces | 2009-01-19 | Paper |
| The Traveling Salesman Problem for Cubic Graphs | 2009-01-19 | Paper |
| Straight Skeletons of Three-Dimensional Polyhedra | 2008-11-25 | Paper |
| Algorithms for media | 2008-09-29 | Paper |
| SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS | 2008-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5458658 | 2008-04-16 | Paper |
| Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes | 2007-10-22 | Paper |
| Drawings of planar graphs with few slopes and segments | 2007-10-12 | Paper |
| The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems | 2007-09-07 | Paper |
| Choosing Colors for Geometric Graphs Via Color Space Embeddings | 2007-08-28 | Paper |
| Upright-Quad Drawing of st-Planar Learning Spaces | 2007-08-28 | Paper |
| Trees with Convex Faces and Optimal Angles | 2007-08-28 | Paper |
| Confluent layered drawings | 2007-05-10 | Paper |
| Minimum dilation stars | 2007-03-15 | Paper |
| Cubic partial cubes from simplicial arrangements | 2007-03-12 | Paper |
| The effect of faults on network expansion | 2007-01-25 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Quasiconvex programming | 2006-04-28 | Paper |
| Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Hinged dissection of polyominoes and polyforms | 2005-08-05 | Paper |
| Fast hierarchical clustering and other applications of dynamic closest pairs | 2005-08-04 | Paper |
| PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS | 2005-06-10 | Paper |
| QUADRILATERAL MESHING BY CIRCLE PACKING | 2005-06-10 | Paper |
| Fast Approximation of Centrality | 2005-05-25 | Paper |
| The lattice dimension of a graph | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657580 | 2005-03-14 | Paper |
| 3-coloring in time | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471349 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471285 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464718 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464720 | 2004-05-27 | Paper |
| Tiling space and slabs with acute tetrahedra. | 2004-03-29 | Paper |
| Small Maximal Independent Sets and Faster Exact Graph Coloring | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407712 | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422271 | 2003-09-03 | Paper |
| Setting Parameters by Example | 2003-06-19 | Paper |
| The minimum expectation selection problem | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778547 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778579 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778539 | 2002-11-18 | Paper |
| Multivariate regression depth | 2002-11-18 | Paper |
| Algorithms for coloring quadtrees | 2002-10-23 | Paper |
| Tangent Spheres and Triangle Centers | 2002-09-12 | Paper |
| Beta-skeletons have unbounded dilation | 2002-09-03 | Paper |
| The distribution of loop lengths in graphical models for turbo decoding | 2002-08-04 | Paper |
| Computing the depth of a flat | 2002-07-22 | Paper |
| Fast approximation of centrality | 2002-03-24 | Paper |
| Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. | 2002-01-30 | Paper |
| Internet packet filter management and rectangle geometry | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230329 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230327 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407719 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407713 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488857 | 2001-08-20 | Paper |
| Incremental and Decremental Maintenance of Planar Width | 2000-12-19 | Paper |
| Geometric Thickness of Complete Graphs | 2000-12-14 | Paper |
| Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945509 | 2000-09-24 | Paper |
| Subgraph Isomorphism in Planar Graphs and Related Problems | 2000-09-19 | Paper |
| Diameter and treewidth in minor-closed graph families | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252729 | 2000-04-26 | Paper |
| Regression depth and center points. | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234116 | 1999-09-15 | Paper |
| Geometric lower bounds for parametric matroid optimization | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250231 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252303 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252399 | 1999-06-17 | Paper |
| Optimal Point Placement for Mesh Smoothing | 1999-05-31 | Paper |
| Linear complexity hexahedral mesh generation | 1999-05-03 | Paper |
| Separator-Based Sparsification II: Edge and Vertex Connectivity | 1998-09-21 | Paper |
| Finding the k Shortest Paths | 1998-09-21 | Paper |
| On triangulating three-dimensional polygons | 1998-08-02 | Paper |
| Faster Circle Packing with Application to Nonobtuse Triangulation | 1998-02-26 | Paper |
| Sparsification—a technique for speeding up dynamic graph algorithms | 1998-02-17 | Paper |
| Minimum Range Balanced Cuts via Dynamic Subset Sums | 1997-11-10 | Paper |
| Faster geometric \(k\)-point MST approximation | 1997-10-28 | Paper |
| Choosing Subsets with Maximum Weighted Average | 1997-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335197 | 1997-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129922 | 1997-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335206 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886099 | 1997-03-23 | Paper |
| Algorithms for proximity problems in higher dimensions | 1997-01-14 | Paper |
| APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS | 1996-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886048 | 1996-11-04 | Paper |
| Average case analysis of dynamic geometric optimization | 1996-11-04 | Paper |
| Separator based sparsification. I: Planarity testing and minimum spanning trees | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858443 | 1995-12-13 | Paper |
| Offline Algorithms for Dynamic Minimum Spanning Tree Problems | 1995-11-22 | Paper |
| TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES | 1995-08-27 | Paper |
| Asymptotic speed-ups in constructive solid geometry | 1995-08-09 | Paper |
| Sparse dynamic programming II | 1995-07-13 | Paper |
| TRIANGULATING POLYGONS WITHOUT LARGE ANGLES | 1995-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763392 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763388 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327371 | 1995-04-05 | Paper |
| Dynamic Euclidean minimum spanning trees and extrema of binary functions | 1995-03-20 | Paper |
| Iterated nearest neighbors and finding minimal polytopes | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140402 | 1994-11-29 | Paper |
| Provably good mesh generation | 1994-11-01 | Paper |
| Approximating the minimum weight Steiner triangulation | 1994-10-19 | Paper |
| Arboricity and bipartite subgraph listing algorithms | 1994-09-25 | Paper |
| Sparse dynamic programming I | 1994-08-21 | Paper |
| On the number of minimal 1-Steiner trees | 1994-08-10 | Paper |
| Visibility with a moving point of view | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138871 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138884 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138931 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138950 | 1993-10-20 | Paper |
| Connectivity, graph minors, and subgraph multiplicity | 1993-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036603 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037435 | 1993-05-18 | Paper |
| Improved bounds for intersecting triangles and halving planes | 1993-05-16 | Paper |
| POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS | 1993-04-01 | Paper |
| Dynamic Three-Dimensional Linear Programming | 1993-02-25 | Paper |
| Parallel recognition of series-parallel graphs | 1993-01-17 | Paper |
| Finding the \(k\) smallest spanning trees | 1992-12-14 | Paper |
| The farthest point Delaunay triangulation minimizes angles | 1992-08-13 | Paper |
| Simultaneous strong separations of probabilistic and unambiguous complexity classes | 1992-06-28 | Paper |
| Maintenance of a minimum spanning forest in a dynamic plane graph | 1992-06-28 | Paper |
| Finding minimum area \(k\)-gons | 1992-06-28 | Paper |
| Equipartitions of graphs | 1992-06-28 | Paper |
| Planar orientations with low out-degree and compaction of adjacency matrices | 1992-06-26 | Paper |
| THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359791 | 1991-01-01 | Paper |
| Sequence comparison with mixed convex and concave costs | 1990-01-01 | Paper |
| Reset Sequences for Monotonic Automata | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206397 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033316 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813298 | 1988-01-01 | Paper |
| Product structure extension of the Alon--Seymour--Thomas theorem | N/A | Paper |
| Non-Euclidean Erd\H{o}s-Anning Theorems | N/A | Paper |
