Erik D. Demaine
Orcid: 0000-0003-3803-5703Affiliations:
- MIT, Cambridge, US
According to our database1,
Erik D. Demaine
authored at least 533 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2016, "For contributions to geometric computing, data structures and graph algorithms".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More.
Proceedings of the Unconventional Computation and Natural Computation, 2024
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Proceedings of the ACM Symposium on Computational Fabrication, 2024
Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds.
Proceedings of the 30th International Conference on DNA Computing and Molecular Programming, 2024
2023
Algorithmica, November, 2023
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.
Theor. Comput. Sci., August, 2023
Comput. Geom., August, 2023
CoRR, 2023
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023
Super Guarding and Dark Rays in Art Galleries.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
2022
ACM J. Exp. Algorithmics, 2022
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
ZHED is NP-complete.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
2021
Theor. Comput. Sci., 2021
Comput. Geom., 2021
Comput. Geom., 2021
Algorithmica, 2021
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
Algorithmica, 2021
Proceedings of the 2021 International Conference on Rebooting Computing (ICRC), Los Alamitos, CA, USA, November 30, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
Yin-Yang Puzzles are NP-complete.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Edge-Unfolding Prismatoids: Tall or Rectangular Base.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Folding Points to a Point and Lines to a Line.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect.
Theor. Comput. Sci., 2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment.
J. Inf. Process., 2020
J. Inf. Process., 2020
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020.
CoRR, 2020
Comput. Geom., 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Some Polycubes Have No Edge Zipper Unfolding.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
Tribute to Godfried Toussaint.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
Folding Small Polyominoes into a Unit Cube.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
New Results in Sona Drawing: Hardness and TSP Separation.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2048 Without Merging.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM J. Comput., 2019
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs.
J. Comput. Syst. Sci., 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019
2018
IEEE Trans. Robotics, 2018
Theor. Comput. Sci., 2018
J. Comput. Geom., 2018
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard.
CoRR, 2018
Algorithmica, 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018
2017
Theor. Comput. Sci., 2017
J. Inf. Process., 2017
J. Inf. Process., 2017
J. Inf. Process., 2017
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs.
CoRR, 2017
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
Snipperclips: Cutting Tools into Desired Polygons using Themselves.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
Computing 3SAT on a Fold-and-Cut Machine.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
Algorithmica, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016
Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms.
Proceedings of the Reversible Computation - 8th International Conference, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 8th International Conference on Fun with Algorithms, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations.
CoRR, 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Proceedings of the IEEE International Conference on Robotics and Automation, 2015
A Dissimilarity Measure for Comparing Origami Crease Patterns.
Proceedings of the ICPRAM 2015, 2015
Proceedings of the 31st International Symposium on Computational Geometry, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
ACM Trans. Algorithms, 2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm.
Graphs Comb., 2014
CoRR, 2014
Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding.
CoRR, 2014
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
Algorithmica, 2014
Proceedings of the 23rd International World Wide Web Conference, 2014
Proceedings of the Distributed Computing - 28th International Symposium, 2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Particle computation: Designing worlds to control robot swarms with only global signals.
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
2013
J. Inf. Process., 2013
J. Comb. Optim., 2013
Int. J. Comput. Geom. Appl., 2013
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121).
Dagstuhl Reports, 2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Discrete and Computational Geometry and Graphs, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
Proceedings of the Space-Efficient Data Structures, 2013
Proceedings of the Algorithms for Sensor Systems, 2013
2012
Internet Math., 2012
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
CoRR, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
IEEE Trans. Robotics, 2011
Integer point sets minimizing average pairwise L<sub>1</sub> distance: What is the optimal shape of a town?
Comput. Geom., 2011
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract).
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
Proceedings of the String Processing and Information Retrieval, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the Descriptional Complexity of Formal Systems, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
IEEE/ACM Trans. Netw., 2010
Int. J. Shape Model., 2010
Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?
CoRR, 2010
CoRR, 2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the Algorithm Theory, 2010
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Proceedings of the Fun with Algorithms, 5th International Conference, 2010
Proceedings of the Fun with Algorithms, 5th International Conference, 2010
Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the Computational Geometry, Graphs and Applications, 2010
Proceedings of the Computational Geometry, Graphs and Applications, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
ACM Trans. Algorithms, 2009
Algorithmica, 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the IEEE International Conference on Shape Modeling and Applications, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009
Games, puzzles and computation.
A K Peters, ISBN: 978-1-56881-322-6, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
ACM Trans. Algorithms, 2008
SIAM J. Comput., 2008
Nat. Comput., 2008
J. Discrete Algorithms, 2008
J. Discrete Algorithms, 2008
Comb., 2008
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica, 2008
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008
Computational Balloon Twisting: The Theory of Balloon Polyhedra.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
Proceedings of the Approximation, 2008
2007
Theor. Comput. Sci., 2007
SIAM J. Comput., 2007
J. Graph Algorithms Appl., 2007
Graphs Comb., 2007
A Pseudopolynomial Time <i>O</i> (log <i>n</i> )-Approximation Algorithm for Art Gallery Problems.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Proceedings of the Computational Geometry and Graph Theory, 2007
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
Open Problems from CCCG 2006.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Geometric folding algorithms - linkages, origami, polyhedra.
Cambridge University Press, 2007
2006
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management.
Comput. Commun., 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
De Dictionariis Dynamicis Pauco Spatio Utentibus (<i>lat.</i> On Dynamic Dictionaries Using Little Space).
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the Algorithms, 2006
Proceedings of the Algorithms, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation.
Theor. Comput. Sci., 2005
Fixed-parameter algorithms for (<i>k</i>, <i>r</i>)-center in planar graphs and map graphs.
ACM Trans. Algorithms, 2005
Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i>-minor-free graphs.
J. ACM, 2005
Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve.
Int. J. Comput. Geom. Appl., 2005
Discret. Comput. Geom., 2005
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
Algorithmica, 2005
Acta Informatica, 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Algorithms, 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Equivalence of local treewidth and linear local treewidth and its algorithmic applications.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Subexponential parameterized algorithms on graphs of bounded-genus and <i>H</i>-minor-free graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth.
Proceedings of the Graph Drawing, 12th International Symposium, 2004
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Discret. Comput. Geom., 2003
Bioinform., 2003
Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, 2003
Proceedings of the Approximation, 2003
Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Algorithms, 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
Open Problems from ALENEX 2003.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003
2002
Graphs Comb., 2002
Proceedings of the Algorithm Theory, 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Exponential Speedup of Fixed-Parameter Algorithms on K<sub>3, 3</sub>-Minor-Free or K<sub>5</sub>-Minor-Free Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002
2001
IEEE Trans. Parallel Distributed Syst., 2001
Discret. Comput. Geom., 2001
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001
2000
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR, 2000
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom., 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Every Polygon Can Be Untangled.
EuroCG, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1999
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1998
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998
Proceedings of the Graph Drawing, 6th International Symposium, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1996
Int. J. High Speed Comput., 1996