Steven Chaplick

Orcid: 0000-0003-3501-4608

Affiliations:
  • Maastricht University, The Netherlands


According to our database1, Steven Chaplick authored at least 68 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs.
CoRR, 2024

Relaxed Agreement Forests.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Morphing Triangle Contact Representations of Triangulations.
Discret. Comput. Geom., October, 2023

Intersection graphs of non-crossing paths.
Discret. Math., August, 2023

The Complexity of Drawing Graphs on Few Lines and Few Planes.
J. Graph Algorithms Appl., 2023

Relaxed Agreement Forests.
CoRR, 2023

Planar L-Drawings of Directed Graphs.
Comput. Geom. Topol., 2023

Snakes and Ladders: A Treewidth Story.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022
Set Visualization and Uncertainty (Dagstuhl Seminar 22462).
Dagstuhl Reports, November, 2022

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.
Theor. Comput. Sci., 2022

Planar L-Drawings of Bimodal Graphs.
J. Graph Algorithms Appl., 2022

On Upward-Planar L-Drawings of Graphs.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Morphing Rectangular Duals.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Testing Upward Planarity of Partial 2-Trees.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Bounding and Computing Obstacle Numbers of Graphs.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Algorithms for Upward Planarity.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Query minimization under stochastic uncertainty.
Theor. Comput. Sci., 2021

Kernelization of Graph Hamiltonicity: Proper H-Graphs.
SIAM J. Discret. Math., 2021

On H-Topological Intersection Graphs.
Algorithmica, 2021

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Generalized Disk Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Edge-Minimum Saturated k-Planar Drawings.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171).
NII Shonan Meet. Rep., 2020

Drawing graphs on few lines and few planes.
J. Comput. Geom., 2020

Recognizing Stick Graphs with and without Length Constraints.
J. Graph Algorithms Appl., 2020

Bundled Crossings Revisited.
J. Graph Algorithms Appl., 2020

On independent set in B1-EPG graphs.
Discret. Appl. Math., 2020

Edge-Minimum Saturated k-Planar Drawings.
CoRR, 2020

Monotone Arc Diagrams with few Biarcs.
CoRR, 2020

On Layered Fan-Planar Graph Drawings.
CoRR, 2020

Drawing Graphs with Circular Arcs and Right-Angle Crossings.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Layered Fan-Planar Graph Drawings.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Recognizing Proper Tree-Graphs.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
Extending partial representations of circle graphs.
J. Graph Theory, 2019

Compact drawings of 1-planar graphs with right-angle crossings and few bends.
Comput. Geom., 2019

Stick Graphs with Length Constraints.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On Arrangements of Orthogonal Circles.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Morphing Contact Representations of Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Grid Intersection Graphs and Order Dimension.
Order, 2018

Placing your coins on a shelf.
J. Comput. Geom., 2018

On the structure of (pan, even hole)-free graphs.
J. Graph Theory, 2018

On some graphs with a unique perfect matching.
Inf. Process. Lett., 2018

The Partial Visibility Representation Extension Problem.
Algorithmica, 2018

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximation Schemes for Geometric Coverage Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Combinatorial Problems on H-graphs.
Electron. Notes Discret. Math., 2017

Ferrers dimension of grid intersection graphs.
Discret. Appl. Math., 2017

Max point-tolerance graphs.
Discret. Appl. Math., 2017

Threshold-coloring and unit-cube contact representation of planar graphs.
Discret. Appl. Math., 2017

Beyond Outerplanarity.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Vertex- and Empty-Ply Proximity Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
A Note on Concurrent Graph Sharing Games.
Integers, 2016

Obstructing Visibilities with One Obstacle.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Simultaneous Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.
Theor. Comput. Sci., 2015

2014
The vertex leafage of chordal graphs.
Discret. Appl. Math., 2014

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Intersection Dimension of Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
Planar Graphs as VPG-Graphs.
J. Graph Algorithms Appl., 2013

Edge Intersection Graphs of L-Shaped Paths in Grids.
Electron. Notes Discret. Math., 2013

Equilateral L-Contact Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Threshold-Coloring and Unit-Cube Contact Representation of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Stabbing Polygonal Chains with Rays is Hard to Approximate.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Path Graphs and PR-trees.
PhD thesis, 2012

Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
From Path Graphs to Directed Path Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010


  Loading...