| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126482 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126484 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126513 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126515 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126516 | 2024-04-09 | Paper |
| Particle computation: complexity, algorithms, and logic | 2024-02-09 | Paper |
| Chess Equilibrium Puzzles | 2023-11-17 | Paper |
| Traversability, reconfiguration, and reachability in the gadget framework | 2023-11-17 | Paper |
| Arithmetic Expression Construction. | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065414 | 2023-11-14 | Paper |
| Recursed Is Not Recursive: A Jarring Result | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059982 | 2023-11-02 | Paper |
| When Can You Tile an Integer Rectangle with Integer Squares? | 2023-08-29 | Paper |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets | 2023-08-01 | Paper |
| Any Platonic solid can transform to another by \(O(1)\) refoldings | 2023-07-12 | Paper |
| Negative instance for the edge patrolling beacon problem | 2023-03-31 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875768 | 2023-02-03 | Paper |
| This Game Is Not Going To Analyze Itself | 2023-02-02 | Paper |
| Rectangular spiral galaxies are still hard | 2023-01-09 | Paper |
| PSPACE-completeness of reversible deterministic systems | 2022-12-09 | Paper |
| Strings-and-Coins and Nimstring are PSPACE-complete | 2022-10-14 | Paper |
| Developing a tetramonohedron with minimum cut length | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104352 | 2022-09-09 | Paper |
| Area-Optimal Simple Polygonalizations: The CG Challenge 2019 | 2022-09-06 | Paper |
| Traversability, reconfiguration, and reachability in the gadget framework | 2022-07-13 | Paper |
| Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets | 2022-07-13 | Paper |
| Rigid flattening of polyhedra with slits | 2022-05-24 | Paper |
| Filling a hole in a crease pattern: Isometric mapping from prescribed boundary folding | 2022-05-24 | Paper |
| Scaling any surface down to any fraction | 2022-05-24 | Paper |
| Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations | 2022-05-24 | Paper |
| Weaving a uniformly thick sheet from rectangles | 2022-05-24 | Paper |
| Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075776 | 2022-05-11 | Paper |
| Ununfoldable polyhedra with \(6\) vertices or \(6\) faces | 2022-04-08 | Paper |
| Strings-and-Coins and Nimstring are PSPACE-complete | 2022-03-25 | Paper |
| On the effects of hierarchical self-assembly for reducing program-size complexity | 2021-11-11 | Paper |
| Continuous flattening of all polyhedral manifolds using countably infinite creases | 2021-09-17 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
| Belga B-trees | 2021-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993299 | 2021-06-15 | Paper |
| Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers | 2021-04-19 | Paper |
| Approximating the Canadian traveller problem with online randomization | 2021-04-19 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133640 | 2020-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133641 | 2020-11-10 | Paper |
| Existence and hardness of conveyor belts | 2020-11-05 | Paper |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 2020-10-23 | Paper |
| Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible | 2020-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116496 | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116497 | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115797 | 2020-08-18 | Paper |
| The Computational Complexity of Portal and Other 3D Video Games | 2020-08-11 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible | 2020-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305729 | 2020-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305736 | 2020-08-11 | Paper |
| Solving the Rubik's Cube Optimally is NP-complete | 2020-08-05 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295674 | 2020-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295681 | 2020-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295683 | 2020-07-10 | Paper |
| Polyhedral characterization of reversible hinged dissections | 2020-04-03 | Paper |
| Infinite all-layers simple foldability | 2020-04-03 | Paper |
| Path puzzles: discrete tomography with a path constraint is hard | 2020-04-03 | Paper |
| Cookie clicker | 2020-04-03 | 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 |
| Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch | 2019-12-09 | Paper |
| Simulation of programmable matter systems using active tile-based self-assembly | 2019-12-05 | Paper |
| Belga B-trees | 2019-10-22 | Paper |
| Structural sparsity of complex networks: bounded expansion in random models and real-world graphs | 2019-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5379516 | 2019-06-12 | Paper |
| Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633860 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633931 | 2019-05-06 | Paper |
| Any monotone function is realized by interlocked polygons | 2019-03-26 | Paper |
| Flat foldings of plane graphs with prescribed angles and edge lengths | 2019-02-27 | Paper |
| Upward Partitioned Book Embeddings | 2019-02-20 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2019-02-14 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Conflict-Free Coloring of Graphs | 2018-11-28 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| The fewest clues problem | 2018-11-23 | Paper |
| Interlocked open linkages with few joints | 2018-11-23 | Paper |
| Vertex-unfoldings of simplicial manifolds | 2018-11-23 | Paper |
| Know when to fold 'em: self-assembly of shapes by folding in oritatami | 2018-11-08 | Paper |
| Ordinal embeddings of minimum relaxation | 2018-11-05 | Paper |
| Bumpy pyramid folding | 2018-10-31 | Paper |
| Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs | 2018-10-30 | Paper |
| Minimizing Movement: Fixed-Parameter Tractability | 2018-10-30 | Paper |
| Reconfiguring massive particle swarms with limited, global control | 2018-10-17 | Paper |
| Juggling and Card Shuffling Meet Mathematical Fonts | 2018-10-09 | Paper |
| Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect | 2018-10-04 | Paper |
| Origamizer: A Practical Algorithm for Folding Any Polyhedron | 2018-08-13 | Paper |
| Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces | 2018-07-16 | Paper |
| Three Colors Suffice: Conflict-Free Coloring of Planar Graphs | 2018-07-16 | Paper |
| Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class | 2018-06-07 | Paper |
| A simple proof that the \((n^{2} - 1)\)-puzzle is hard | 2018-06-07 | Paper |
| Continuously Flattening Polyhedra Using Straight Skeletons | 2018-04-23 | Paper |
| Pachinko | 2018-02-19 | Paper |
| Who Needs Crossings? Hardness of Plane Graph Rigidity | 2018-01-30 | Paper |
| The Complexity of Hex and the Jordan Curve Theorem | 2017-12-19 | Paper |
| Unfolding genus-2 orthogonal polyhedra with linear refinement | 2017-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368669 | 2017-10-10 | Paper |
| Geodesic ham-sandwich cuts | 2017-09-29 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| An energy-driven approach to linkage unfolding | 2017-09-29 | Paper |
| Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve | 2017-09-29 | Paper |
| Low-dimensional embedding with extra information | 2017-09-29 | Paper |
| A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting | 2017-09-29 | Paper |
| Embedding stacked polytopes on a polynomial-size grid | 2017-09-29 | Paper |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 2017-09-22 | Paper |
| Inapproximability of the standard pebble game and hard to pebble graphs | 2017-09-22 | Paper |
| Arboral satisfaction: recognition and LP approximation | 2017-08-16 | Paper |
| Push-Pull Block Puzzles are Hard | 2017-07-21 | Paper |
| The Fewest Clues Problem | 2017-07-17 | Paper |
| Super Mario Bros. Is Harder/Easier than We Thought | 2017-07-17 | Paper |
| Embedding stacked polytopes on a polynomial-size grid | 2017-06-16 | Paper |
| New geometric algorithms for fully connected staged self-assembly | 2017-05-18 | Paper |
| On Cartesian trees and range minimum queries | 2017-05-17 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| Rigid Origami Vertices: Conditions and Forcing Sets | 2017-03-30 | Paper |
| Necklaces, convolutions, and \(X+Y\) | 2017-03-27 | Paper |
| Minimal forcing sets for 1D origami | 2017-03-18 | Paper |
| Dissection with the Fewest Pieces is Hard, Even to Approximate | 2017-02-01 | Paper |
| Mario Kart Is Hard | 2017-02-01 | Paper |
| Continuous Flattening of Orthogonal Polyhedra | 2017-02-01 | Paper |
| Bust-a-Move/Puzzle Bobble Is NP-complete | 2017-02-01 | Paper |
| Box Pleating is Hard | 2017-02-01 | Paper |
| Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | 2017-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957882 | 2017-01-30 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms | 2016-08-10 | Paper |
| Energy-Efficient Algorithms | 2016-04-15 | Paper |
| The two-handed tile assembly model is not intrinsically universal | 2016-03-29 | Paper |
| One-dimensional staged self-assembly | 2016-03-10 | Paper |
| Folding a paper strip to minimize thickness | 2016-02-18 | Paper |
| FOLDING EQUILATERAL PLANE GRAPHS | 2015-12-22 | Paper |
| CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION | 2015-12-22 | Paper |
| Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs | 2015-12-04 | Paper |
| Cache-Oblivious Iterated Predecessor Queries via Range Coalescing | 2015-10-30 | Paper |
| Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949117 | 2015-10-07 | Paper |
| New geometric algorithms for fully connected staged self-assembly | 2015-09-30 | Paper |
| Linear-time algorithm for sliding tokens on trees | 2015-09-16 | Paper |
| On Wrapping Spheres and Cubes with Rectangular Paper | 2015-09-14 | Paper |
| Polynomial-Time Algorithm for Sliding Tokens on Trees | 2015-09-11 | Paper |
| Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs | 2015-09-02 | Paper |
| Retroactive data structures | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501238 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501269 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501303 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501345 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501346 | 2015-08-03 | Paper |
| Worst-case optimal tree layout in external memory | 2015-07-10 | Paper |
| Reconfigurable asynchronous logic automata | 2015-06-11 | Paper |
| Swapping labeled tokens on graphs | 2015-05-26 | Paper |
| Fun with fonts: algorithmic typography | 2015-05-26 | Paper |
| Classic Nintendo games are (computationally) hard | 2015-05-26 | Paper |
| Folding a Paper Strip to Minimize Thickness | 2015-02-27 | Paper |
| Approximability of the subset sum reconfiguration problem | 2015-01-21 | Paper |
| Picture-hanging puzzles | 2015-01-21 | Paper |
| Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths | 2015-01-07 | Paper |
| Correction: Basic Network Creation Games | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934604 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934606 | 2014-12-18 | Paper |
| Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs | 2014-12-02 | Paper |
| Minimizing movement | 2014-11-18 | Paper |
| An optimal decomposition algorithm for tree edit distance | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921717 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921724 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921728 | 2014-10-13 | Paper |
| The price of anarchy in network creation games | 2014-09-09 | Paper |
| One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile | 2014-07-01 | Paper |
| Canadians Should Travel Randomly | 2014-07-01 | Paper |
| Contraction decomposition in h-minor-free graphs and algorithmic applications | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417628 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417689 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417721 | 2014-05-22 | Paper |
| Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm | 2014-03-24 | Paper |
| The price of anarchy in network creation games | 2014-03-13 | Paper |
| Scheduling to minimize gaps and power consumption | 2014-02-05 | Paper |
| UNO is hard, even for a single player | 2014-01-22 | Paper |
| Reprint of: Refold rigidity of convex polyhedra | 2014-01-22 | Paper |
| The Voronoi game on graphs and its complexity | 2013-11-28 | Paper |
| Basic Network Creation Games | 2013-09-26 | Paper |
| Variations on Instant Insanity | 2013-09-13 | Paper |
| Blame Trees | 2013-08-12 | Paper |
| Combining Binary Search Trees | 2013-08-06 | Paper |
| The Two-Handed Tile Assembly Model Is Not Intrinsically Universal | 2013-08-06 | Paper |
| Efficient reconfiguration of lattice-based modular robots | 2013-07-31 | Paper |
| Refold rigidity of convex polyhedra | 2013-07-31 | Paper |
| GHOST CHIMNEYS | 2013-06-24 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| Approximation algorithms via contraction decomposition | 2013-04-05 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| A Generalization of the Source Unfolding of Convex Polyhedra | 2013-01-07 | Paper |
| Meshes Preserving Minimum Feature Size | 2013-01-07 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| Reconfiguration of list edge-colorings in a graph | 2012-10-26 | Paper |
| Non-crossing matchings of points with geometric objects | 2012-10-12 | Paper |
| Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising | 2012-08-29 | Paper |
| On \(k\)-convex polygons | 2012-06-13 | Paper |
| Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs | 2012-04-24 | Paper |
| The Price of Anarchy in Cooperative Network Creation Games | 2012-04-24 | Paper |
| Hinged dissections exist | 2012-03-02 | Paper |
| (Non)Existence of pleated folds: How paper folds between creases | 2012-01-24 | Paper |
| Algorithmic folding complexity | 2012-01-24 | Paper |
| Continuous blooming of convex polyhedra | 2012-01-24 | Paper |
| Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) | 2012-01-23 | Paper |
| Folding Equilateral Plane Graphs | 2011-12-16 | Paper |
| Making Polygons by Simple Folds and One Straight Cut | 2011-11-11 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| Algorithms for Solving Rubik’s Cubes | 2011-09-16 | Paper |
| One-Dimensional Staged Self-assembly | 2011-09-16 | Paper |
| O(1)-Approximations for Maximum Movement Problems | 2011-08-17 | Paper |
| Lossless Fault-Tolerant Data Structures with Additive Overhead | 2011-08-12 | Paper |
| Flattening Fixed-Angle Chains Is Strongly NP-Hard | 2011-08-12 | Paper |
| Remarks on Separating Words | 2011-07-29 | Paper |
| Approximability of the Subset Sum Reconfiguration Problem | 2011-07-01 | Paper |
| COMPUTING SIGNED PERMUTATIONS OF POLYGONS | 2011-06-17 | Paper |
| Finding Hidden Independent Sets in Interval Graphs | 2011-03-18 | Paper |
| Tetris is Hard, Even to Approximate | 2011-03-18 | Paper |
| On the complexity of reconfiguration problems | 2011-03-14 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Realistic Reconfiguration of Crystalline (and Telecube) Robots | 2011-03-02 | Paper |
| Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? | 2011-01-31 | Paper |
| Covering points by disjoint boxes with outliers | 2011-01-21 | Paper |
| Constant Price of Anarchy in Network Creation Games via Public Service Advertising | 2011-01-21 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| Combination can be hard | 2010-08-16 | Paper |
| Lower bounds for asymmetric communication channels and distributed source coding | 2010-08-16 | Paper |
| Lower bounds for dynamic connectivity | 2010-08-15 | Paper |
| Cache-oblivious priority queue and graph algorithm applications | 2010-08-05 | Paper |
| GRID VERTEX-UNFOLDING ORTHOSTACKS | 2010-07-27 | Paper |
| Playing Games with Algorithms: Algorithmic Combinatorial Game Theory | 2010-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574138 | 2010-07-09 | Paper |
| Minimizing the Diameter of a Network Using Shortcut Edges | 2010-06-22 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Confluently persistent tries for efficient version control | 2010-05-19 | Paper |
| Matching Points with Things | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Generalized D-forms have no spurious creases | 2010-02-23 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Algorithmic Folding Complexity | 2009-12-17 | Paper |
| Folding a Better Checkerboard | 2009-12-17 | Paper |
| Minimizing Movement: Fixed-Parameter Tractability | 2009-10-29 | Paper |
| Minimal Locked Trees | 2009-10-20 | Paper |
| Reconfiguration of List Edge-Colorings in a Graph | 2009-10-20 | Paper |
| A Pseudopolynomial Algorithm for Alexandrov’s Theorem | 2009-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395518 | 2009-09-04 | Paper |
| Combination Can Be Hard: Approximability of the Unique Coverage Problem | 2009-08-20 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Linear reconfiguration of cube-style modular robots | 2009-07-27 | Paper |
| Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs | 2009-07-14 | Paper |
| Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs | 2009-07-14 | Paper |
| On Cartesian Trees and Range Minimum Queries | 2009-07-14 | Paper |
| Wrapping spheres with flat paper | 2009-06-30 | Paper |
| Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction | 2009-06-22 | Paper |
| Dynamic ham-sandwich cuts in the plane | 2009-06-18 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Refolding planar polygons | 2009-04-27 | Paper |
| Approximability of partitioning graphs with supply and demand | 2009-02-23 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems | 2009-02-17 | Paper |
| Hinged dissections exist | 2009-02-12 | Paper |
| Tight bounds for dynamic convex hull queries (again) | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601524 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601540 | 2009-02-10 | Paper |
| On the Complexity of Reconfiguration Problems | 2009-01-29 | Paper |
| Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves | 2009-01-29 | Paper |
| Planar Embeddings of Graphs with Specified Edge Lengths | 2009-01-19 | Paper |
| Deflating the Pentagon | 2009-01-13 | Paper |
| Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction | 2008-11-27 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | Paper |
| Linearity of grid minors in treewidth with applications through bidimensionality | 2008-10-21 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| Optimally Adaptive Integration of Univariate Lipschitz Functions | 2008-09-18 | Paper |
| De Dictionariis Dynamicis Pauco Spatio Utentibus | 2008-09-18 | Paper |
| Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues | 2008-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3523033 | 2008-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514523 | 2008-07-21 | Paper |
| Confluently Persistent Tries for Efficient Version Control | 2008-07-15 | Paper |
| Algorithmic Graph Minors and Bidimensionality | 2008-06-05 | Paper |
| Linear Reconfiguration of Cube-Style Modular Robots | 2008-05-27 | Paper |
| Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction | 2008-04-24 | Paper |
| Approximability of Partitioning Graphs with Supply and Demand | 2008-04-24 | Paper |
| Subquadratic algorithms for 3SUM | 2008-04-23 | Paper |
| Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues | 2008-04-04 | Paper |
| Communication-aware processor allocation for supercomputers: Finding point sets of small average distance | 2008-04-03 | Paper |
| Optimally adaptive integration of univariate Lipschitz functions | 2008-04-03 | Paper |
| Dynamic Optimality—Almost | 2008-03-28 | Paper |
| Grid Vertex-Unfolding Orthostacks | 2008-03-18 | Paper |
| Origami, Linkages, and Polyhedra: Folding with Algorithms | 2008-03-11 | Paper |
| Necklaces, Convolutions, and X + Y | 2008-03-11 | Paper |
| Plane embeddings of planar graph metrics | 2008-01-04 | Paper |
| An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms | 2008-01-03 | Paper |
| An Optimal Decomposition Algorithm for Tree Edit Distance | 2007-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5427478 | 2007-11-20 | Paper |
| Edge-unfolding nested polyhedral bands | 2007-10-19 | Paper |
| A unified access bound on comparison-based dynamic dictionaries | 2007-09-18 | Paper |
| Sand drawings and Gaussian graphs§ | 2007-09-12 | Paper |
| Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity | 2007-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3445222 | 2007-06-08 | Paper |
| The Bidimensional Theory of Bounded-Genus Graphs | 2007-05-22 | Paper |
| Geodesic ham-sandwich cuts | 2007-04-26 | Paper |
| Morpion solitaire | 2007-02-13 | Paper |
| Puzzles, art, and magic with algorithms | 2007-02-13 | Paper |
| Quickly deciding minor-closed parameters in general graphs | 2006-12-07 | Paper |
| Low-dimensional embedding with extra information | 2006-12-06 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Correlation clustering in general weighted graphs | 2006-09-14 | Paper |
| Online searching with turn cost | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Geometric restrictions on producible polygonal protein chains | 2006-06-14 | Paper |
| Cache-Oblivious B-Trees | 2006-06-01 | Paper |
| Optimal Covering Tours with Turn Costs | 2006-06-01 | Paper |
| Logarithmic Lower Bounds in the Cell-Probe Model | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290260 | 2006-04-28 | Paper |
| Representing trees of higher degree | 2006-03-21 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Games on triangulations | 2005-10-26 | Paper |
| PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation | 2005-10-26 | Paper |
| OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE | 2005-09-29 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Bidimensional Parameters and Local Treewidth | 2005-09-16 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Hinged dissection of polyominoes and polyforms | 2005-08-05 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024760 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024774 | 2005-07-04 | Paper |
| Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors | 2005-04-29 | Paper |
| Fast allocation and deallocation with an improved buddy system | 2005-04-15 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| Diameter and treewidth in minor-closed graph families, revisited | 2005-02-11 | Paper |
| Finding hidden independent sets in interval graphs | 2004-10-27 | Paper |
| Solitaire clobber | 2004-10-27 | Paper |
| When can you fold a map? | 2004-10-13 | Paper |
| Approximation algorithms for classes of graphs excluding single-crossing graphs as minors | 2004-10-01 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| TETRIS IS HARD, EVEN TO APPROXIMATE | 2004-09-29 | Paper |
| Tight bounds on maximal and maximum matchings | 2004-08-19 | Paper |
| Robot Localization without Depth Perception | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737175 | 2004-08-11 | Paper |
| Proximate point searching | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472479 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474098 | 2004-08-04 | Paper |
| What is the optimal shape of a city? | 2004-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464718 | 2004-05-27 | Paper |
| A linear lower bound on index size for text retrieval | 2004-03-14 | Paper |
| Straightening polygonal arcs and convexifying polygonal cycles | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449223 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407718 | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425961 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| Palindrome recognition using a multidimensional tape. | 2003-08-17 | Paper |
| On universally easy classes for NP-complete problems. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411353 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411355 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411356 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411371 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411278 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410168 | 2003-07-02 | Paper |
| Interlocked open and closed linkages with few joints. | 2003-07-01 | Paper |
| Long proteins with unique optimal foldings in the H-P model | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797605 | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801183 | 2003-04-07 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779132 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778574 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536356 | 2002-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547796 | 2002-08-21 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| Enumerating foldings and unfoldings between polygons and polytopes | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768284 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768307 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768398 | 2002-01-30 | Paper |
| Polygons cuttable by a circular saw | 2002-01-14 | Paper |
| Reconfiguring convex polygons | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407713 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407717 | 2002-01-01 | Paper |
| Efficient Algorithms for Petersen's Matching Theorem | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511242 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504019 | 2000-09-14 | Paper |
| Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952695 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252395 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252281 | 1999-06-17 | Paper |
