Yoshio Okamoto

Patrick Schnider

CoRR, March, 2025

The Solitaire Clobber game and the correducibility of k-connected graphs.

[BibT_eX]

[DOI]

Tatsuya Fujimori

Shun-ichi Maezawa

Discret. Appl. Math., 2025

2024

Loss Minimization for Electrical Flows over Spanning Trees on Grids.

[BibT_eX]

[DOI]

CoRR, 2024

CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

2023

Core Challenge 2023: Solver and Graph Descriptions.

[BibT_eX]

[DOI]

CoRR, 2023

Algorithmic Theory of Qubit Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Minimum Separator Reconfiguration.

[BibT_eX]

[DOI]

Guilherme C. M. Gomes

Clément Legrand-Duchesne

Reem Mahmoud

Amer E. Mouawad

Vinícius Fernandes dos Santos

Tom C. van der Zanden

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Rerouting Planar Curves and Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Reconfiguration of Colorings in Triangulations of the Sphere.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Submodular reassignment problem for reallocating agents to tasks with synergy effects.

[BibT_eX]

[DOI]

Discret. Optim., 2022

Core Challenge 2022: Solver and Graph Descriptions.

[BibT_eX]

[DOI]

Takehide Soh

Takehiro Ito

CoRR, 2022

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Reachable Assignments Under Dichotomous Preferences.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Reforming an Envy-Free Matching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Algorithmic enumeration of surrounding polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

2020

Guest Editorial: Selected Papers from ISAAC 2017.

[BibT_eX]

[DOI]

Algorithmica, 2020

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Algorithmica, 2020

Linear-Time Recognition of Double-Threshold Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Angular Resolutions: Around Vertices and Crossings.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

Variants of the Segment Number of a Graph.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Alexander Ravsky

Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Graphs with Large Total Angular Resolution.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Algorithms for Gerrymandering over Graphs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Computational Complexity of Robot Arm Simulation Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

[BibT_eX]

[DOI]

Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Exact Algorithms for the Max-Min Dispersion Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Haitao Wang

Discret. Comput. Geom., 2017

Sequentially Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Balanced Line Separators of Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Reconfiguration of Maximum-Weight b-Matchings in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Tight Approximability of the Server Allocation Problem for Real-Time Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017

2016

Traveling Sales Person with Few Inner Points.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9).

[BibT_eX]

[DOI]

Siu-Wing Cheng

Otfried Cheong

NII Shonan Meet. Rep., 2016

Extended formulations for sparsity matroids.

[BibT_eX]

[DOI]

Math. Program., 2016

On the treewidth of toroidal grids.

[BibT_eX]

[DOI]

Masashi Kiyomi

Yota Otachi

Discret. Appl. Math., 2016

Tight Exact and Approximate Algorithmic Results on Token Swapping.

[BibT_eX]

[DOI]

CoRR, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Haitao Wang

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Approximation and Hardness of Token Swapping.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Efficient Stabilization of Cooperative Matching Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Polynomial-time approximability of the k-Sink Location problem.

[BibT_eX]

[DOI]

CoRR, 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.

[BibT_eX]

[DOI]

Comput. Geom., 2015

2014

Submodularity of minimum-cost spanning tree games.

[BibT_eX]

[DOI]

Masayuki Kobayashi

Networks, 2014

Approximating the path-distance-width for AT-free graphs and graphs in related classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Minimum-Cost b -Edge Dominating Sets on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Swapping Labeled Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Free Edge Lengths in Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Computing the Geodesic Centers of a Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The complexity of the stamp folding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Takao Asano

Shin-Ichi Nakano

Int. J. Comput. Geom. Appl., 2013

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Exact and fixed-parameter algorithms for metro-line crossing minimization problems.

[BibT_eX]

[DOI]

Yuichi Tatsu

Yushi Uno

CoRR, 2013

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2013

Guest Editorial: Selected Papers from ISAAC 2011.

[BibT_eX]

[DOI]

Takao Asano

Shin-Ichi Nakano

Algorithmica, 2013

Computational complexity and an integer programming model of Shakashaka.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Vertex angle and crossing angle resolution of leveled tree drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Otfried Cheong

Int. J. Comput. Geom. Appl., 2012

On bipartite powers of bigraphs.

[BibT_eX]

[DOI]

Yota Otachi

Discret. Math. Theor. Comput. Sci., 2012

Minimum and maximum against k lies.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Algorithmica, 2012

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.

[BibT_eX]

[DOI]

Masashi Kiyomi

Toshiki Saitoh

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Area Bounds of Rectilinear Polygons Realized by Angle Sequences.

[BibT_eX]

[DOI]

Chan-Su Shin

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On Problems as Hard as CNF-SAT.

[BibT_eX]

[DOI]

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

Submodular fractional programming for balanced clustering.

[BibT_eX]

[DOI]

Yoshinobu Kawahara

Kiyohito Nagano

Pattern Recognit. Lett., 2011

On Problems as Hard as CNFSAT

[BibT_eX]

[DOI]

CoRR, 2011

Not All Saturated 3-Forests Are Tight

[BibT_eX]

[DOI]

CoRR, 2011

The t-Pebbling Number is Eventually Linear in t.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Approximability of the Path-Distance-Width for AT-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Dominating Set Counting in Graph Classes.

[BibT_eX]

[DOI]

Shuji Kijima

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Minimum and Maximum against k Lies.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Adaptive Algorithms for Planar Convex Hull Problems.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

The Geodesic Diameter of Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes.

[BibT_eX]

[DOI]

Heidi Gebauer

Int. J. Found. Comput. Sci., 2009

The Holt-Klee condition for oriented matroids.

[BibT_eX]

[DOI]

Komei Fukuda

Sonoko Moriyama

Eur. J. Comb., 2009

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Querying Two Boundary Points for Shortest Paths in a Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

How to make a picturesque maze.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Traveling Sales Person with Few Inner Points.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Counting the number of independent sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Local topology of the free complex of a two-dimensional generalized convex shelling.

[BibT_eX]

[DOI]

Discret. Math., 2008

Improved Bounds for Wireless Localization.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

Drawing (Complete) Binary Tanglegrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Johan M. M. van Rooij

Ryan Williams

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.

[BibT_eX]

[DOI]

Yota Otachi

Koichi Yamazaki

Discret. Appl. Math., 2007

A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Moving Vertices to Make Drawings Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes.

[BibT_eX]

[DOI]

Heidi Gebauer

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five.

[BibT_eX]

[DOI]

Sonoko Moriyama

IEICE Trans. Inf. Syst., 2006

2005

The affine representation theorem for abstract convex geometries.

[BibT_eX]

[DOI]

Kenji Kashiwabara

Masataka Nakamura

Comput. Geom., 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

Traveling salesman games with the Monge property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Core Stability of Minimum Coloring Games.

[BibT_eX]

[DOI]

Thomas Bietenhader

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

The Minimum Weight Triangulation Problem with Few Inner Points.

[BibT_eX]

[DOI]

Michael Hoffmann

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

The Traveling Salesman Problem with Few Inner Points.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Submodularity of some classes of the combinatorial optimization games.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2003

Some properties of the core on convex geometries.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2003

The forbidden minor characterization of line-search antimatroids of rooted digraphs.

[BibT_eX]

[DOI]

Masataka Nakamura

Discret. Appl. Math., 2003

A greedy algorithm for convex geometries.

[BibT_eX]

[DOI]

Kenji Kashiwabara

Discret. Appl. Math., 2003

Greedy Edge-Disjoint Paths in Complete Graphs.

[BibT_eX]

[DOI]

Paz Carmi

Thomas Erlebach

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Matroid Representation of Clique Complexes.

[BibT_eX]

[DOI]

Kenji Kashiwabara