Dr. Steven Chaplick

I have moved to Maastricht University!
See my new webpage: https://www.maastrichtuniversity.nl/p70068141
Teaching
- WS 2019/2020: Lecturer for Advanced Algorithms
- SS 2019: Lecturer for Graph Visualization
- WS 2018/2019: Lecturer for Exact Algorithms
- SS 2018: Lecturer for Graph Visualization
- WS 2017/2018: Lecturer for Computational Geometry
- SS 2017: Lecturer for Graph Visualization
- WS 2016/2017: Lecturer for Approximation Algorithms
- SS 2016: Lecturer for Graph Visualization
- WS 2015/2016: Lecturer for Computational Geometry
Research Interests
My primary area of interest is algorithmic graph theory and my current research focuses on intersection representations of graphs, efficient methods for graph class recognition, and optimization problems on restricted graph classes.
CV
(see: here for my full CV)
Postdoctoral Work:
- Since Sept. 2015:
Postdoc in the Chair of Computer Science I, Universität Würzburg. - Jan. 2014 – June 2015:
Postdoc in the Algorithmic and Discrete Mathematics Group, TU Berlin. * - Feb. 2013 – Dec. 2013:
Postdoc in the Department of Applied Mathematics, Charles University in Prague. * - Jan. 2012 – Jan. 2013:
Visiting Researcher: Wilfrid Laurier University (Waterloo, Canada), Simon Fraser University (Vancouver, Canada), University of Toronto (Toronto, Canada), Haifa University (Haifa, Israel).
* These positions were supported by the EuroCores EUROGIGA project GraDR.
Studies:
- Feb. 2008 – Jan. 2012:
PhD in Computer Science at the University of Toronto (Advisor: Derek Corneil). - Sept. 2006 – Jan. 2008:
M.Sc in Computer Science at the University of Toronto (Advisor: Derek Corneil). - Sept. 2001 – June 2006:
B.Math double degree in Combinatorics & Optimization and Computer Science at the University of Waterloo.
Academic Service :
- Program Committee Member
WG 2018 : 44th International Workshop on Graph-Theoretic Concepts in Computer Science.
GD 2018 : 26th International Symposium on Graph Drawing and Network Visualization. - (recent) Workshop Organization:
(2018) Workshop on Constrained Recognition Problems. Co-located with ICALP.
(2017) Workshop on Geometric Perspectives in Graph Drawing and Information Visualization. Co-located with SoCG.
(2016) 19th Korean Workshop on Computational Geometry.
(2016) Workshop on Geometric Representations of Graphs. Co-located with SoCG/STOC. - Referee Experience
Journals: CGTA (Journal of Computational Geometry – Theory and Applications), DAM (Discrete Applied Mathematics), DMTCS (Discrete Mathematics & Theoretical Computer Science), IPL (Information Pro- cessing Letters), TCS (Theoretical Computer Science).
Conferences: CALDAM (Conf. on Algorithms and Discrete Applied Mathematics), CIAC (Int. Conf. on Al- gorithms and Complexity), EUROCOMB (Eur. Conf. on Combinatorics, Graph Theory and Applications), FSTTCS (Foundations of Software Technology and Theoretical Computer Science Conf.), GD (Int. Symp. on Graph Drawing and Network Visualization), ICALP (Int. Colloquium on Automata, Languages, and Programming), IWOCA (Int. Workshop on Combinatorial Algorithms), LAGOS (Latin-American Algo- rithms, Graphs, and Optimization Symp.), SoCG (Symp. on Computational Geometry), SODA (ACM- SIAM Symp. on Discrete Algorithms), STACS (Int. Symp. on Theoretical Aspects of Computer Science), STOC (ACM Symp. on Theory of Computing), WADS (Algorithms and Data Structures Symp.), WG (Int. Workshop on Graph-Theoretic Concepts in Computer Science).
Publications
-
Intersection Graphs of Non-crossing Paths in Graph-Theoretic Concepts in Computer Science, I. Sau, D. M. Thilikos (eds.) (2019). 311–324.
-
Compact drawings of 1-planar graphs with right-angle crossings and few bends in Computational Geometry: Theory and Applications (2019). 84 50–68.
-
Kernelization of Graph Hamiltonicity: Proper H-Graphs in WADS, Lecture Notes in Computer Science, Z. Friggstad, J.-R. Sack, M. R. Salavatipour (eds.) (2019). 296–310.
-
Morphing Contact Representations of Graphs. in 35th International Symposium on Computational Geometry (SoCG 2019), Leibniz International Proceedings in Informatics (LIPIcs), G. Barequet, Y. Wang (eds.) (2019). (Vol. 129) 10:1–10:16.
-
On the structure of (pan, even hole)-free graphs in Journal of Graph Theory (2018). 87(1) 108–129.
-
Approximation Schemes for Geometric Coverage Problems in Proc. 26th Annual European Symposium on Algorithms (ESA’18), LIPIcs, Y. Azar, H. Bast, G. Herman (eds.) (2018). (Vol. 112) 17:1–17:15.
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. in Graph Drawing and Network Visualization - 26th International Symposium, {GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings, Lecture Notes in Computer Science, T. C. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 137–151.
-
On some graphs with a unique perfect matching in Information Processing Letters (2018). 139 60–63.
-
Grid Intersection Graphs and Order Dimension in Order (2018). 35(2) 363–391.
-
The Partial Visibility Representation Extension Problem in Algorithmica (2018). 80(8) 2286–2323.
-
Placing your Coins on a Shelf in JoCG (2018). 9(1) 312–327.
-
Max point-tolerance graphs in Discrete Applied Mathematics (2017). 216 84–97.
-
Threshold-coloring and unit-cube contact representation of planar graphs in Discrete Applied Mathematics (2017). 216 2–14.
-
Combinatorial Problems on H -graphs in Electronic Notes in Discrete Mathematics (2017). 61 223–229.
-
The Complexity of Drawing Graphs on Few Lines and Few Planes in Proc. Algorithms Data Struct. Symp. (WADS’17), F. Ellen, A. Kolokolova, J.-R. Sack (eds.) (2017). 265–276.
-
On Vertex- and Empty-Ply Proximity Drawings in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), LNCS, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 24–37.
-
On H-Topological Intersection Graphs in Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, H. L. Bodlaender, G. J. Woeginger (eds.) (2017). 167–179.
-
Planar L-Drawings of Directed Graphs in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), LNCS, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 465–478.
-
Ferrers dimension of grid intersection graphs in Discrete Applied Mathematics (2017). 216 130–135.
-
Placing your Coins on a Shelf in 28th International Symposium on Algorithms and Computation (ISAAC 2017), Leibniz International Proceedings in Informatics (LIPIcs), Y. Okamoto, T. Tokuyama (eds.) (2017). (Vol. 92) 4:1–4:12.
-
Beyond Outerplanarity in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), LNCS, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 546–559.
-
Edge intersection graphs of L-shaped paths in grids in Discrete Applied Mathematics (2016). 210 185–194.
-
The Partial Visibility Representation Extension Problem in Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, Y. Hu, M. N{\"{o}}llenburg (eds.) (2016). (Vol. 9801) 266–279.
-
Simultaneous Orthogonal Planarity in Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, Y. Hu, M. N{\"{o}}llenburg (eds.) (2016). (Vol. 9801) 532–545.
-
Drawing Graphs on Few Lines and Few Planes in Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, Y. Hu, M. N{\"{o}}llenburg (eds.) (2016). (Vol. 9801) 166–180.
-
Obstructing Visibilities with One Obstacle in Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, Y. Hu, M. N{\"{o}}llenburg (eds.) (2016). (Vol. 9801) 295–308.
-
A note on concurrent graph sharing games in Integers (2016). 16 Paper No. G1.
-
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree in Theor. Comput. Sci. (2015). 590 86–95.
-
The vertex leafage of chordal graphs in Discrete Applied Mathematics (2014). 168 14–25.
-
Intersection Dimension of Bipartite Graphs in Theory and Applications of Models of Computation - 11th Annual Conference, {TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings, Lecture Notes in Computer Science, T. V. Gopal, M. Agrawal, A. Li, S. B. Cooper (eds.) (2014). (Vol. 8402) 323–340.
-
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard in Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, Lecture Notes in Computer Science, D. Kratsch, I. Todinca (eds.) (2014). (Vol. 8747) 139–151.
-
Threshold-Coloring and Unit-Cube Contact Representation of Graphs in Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers, Lecture Notes in Computer Science, A. Brandst{\"{a}}dt, K. Jansen, R. Reischuk (eds.) (2013). (Vol. 8165) 26–37.
-
Equilateral L-Contact Graphs in Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers, Lecture Notes in Computer Science, A. Brandst{\"{a}}dt, K. Jansen, R. Reischuk (eds.) (2013). (Vol. 8165) 139–151.
-
Planar Graphs as VPG-Graphs in J. Graph Algorithms Appl. (2013). 17(4) 475–494.
-
Stabbing Polygonal Chains with Rays is Hard to Approximate in Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013 (2013).
-
Extending Partial Representations of Circle Graphs in Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, Lecture Notes in Computer Science, S. K. Wismath, A. Wolff (eds.) (2013). (Vol. 8242) 131–142.
-
Edge Intersection Graphs of L-Shaped Paths in Grids in Electronic Notes in Discrete Mathematics (2013). 44 363–369.
-
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree in Fundamentals of Computation Theory - 19th International Symposium, {FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings, Lecture Notes in Computer Science, L. Gasieniec, F. Wolter (eds.) (2013). (Vol. 8070) 121–132.
-
Planar Graphs as VPG-Graphs in Graph Drawing - 20th International Symposium, {GD} 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.) (2012). (Vol. 7704) 174–186.
-
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill in Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, Lecture Notes in Computer Science, M. C. Golumbic, M. Stern, A. Levy, G. Morgenstern (eds.) (2012). (Vol. 7551) 274–285.
-
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid in Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\’{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers, Lecture Notes in Computer Science, P. Kolman, J. Kratochv{\’{\i}}l (eds.) (2011). (Vol. 6986) 319–330.
-
From Path Graphs to Directed Path Graphs in Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\’{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers, Lecture Notes in Computer Science, D. M. Thilikos (ed.) (2010). (Vol. 6410) 256–265.
Preprints / Tech Reports
-
On Arrangements of Orthogonal Circles (2019).
-
Morphing Contact Representations of Graphs (2019).
-
Intersection Graphs of Non-crossing Paths (2019).
-
Stick Graphs with Length Constraints (2019).
-
Bundled Crossings Revisited in CoRR (2018). abs/1812.04263
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends in CoRR (2018). abs/1806.10044
-
On Vertex- and Empty-Ply Proximity Drawings in CoRR (2017). abs/1708.09233
-
Planar L-Drawings of Directed Graphs in CoRR (2017). abs/1708.09107
-
On some Graphs with a Unique Perfect Matching (2017).
-
Combinatorial Problems on \($H$\)-graphs (2017).
-
Placing your Coins on a Shelf. in CoRR (2017). abs/1707.01239
-
Beyond Outerplanarity in CoRR (2017). abs/1708.08723
-
The Complexity of Drawing Graphs on Few Lines and Few Planes in CoRR (2016). abs/1607.06444
-
Approximation Schemes for Geometric Coverage Problems in CoRR (2016). abs/1607.06665
-
Drawing Graphs on Few Lines and Few Planes in CoRR (2016). abs/1607.01196
-
Simultaneous Orthogonal Planarity in CoRR (2016). abs/1608.08427
-
On H-Topological Intersection Graphs in CoRR (2016). abs/1608.02389
-
Obstructing Visibilities with One Obstacle in CoRR (2016). abs/1607.00278
-
The Partial Visibility Representation Extension Problem in CoRR (2015). abs/1512.00174
-
Max Point-Tolerance Graphs in CoRR (2015). abs/1508.03810
-
Grid Intersection Graphs and Order Dimension (2015).
-
On the structure of (pan, even hole)-free graphs in CoRR (2015). abs/1508.03062
-
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree in CoRR (2014). abs/1408.6676
-
A note on concurrent graph sharing games (2014).
-
Equilateral L-Contact Graphs in CoRR (2013). abs/1303.1279
-
Extending Partial Representations of Circle Graphs in CoRR (2013). abs/1309.2399
-
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill in CoRR (2012). abs/1206.5159
-
Edge Intersection Graphs of L-Shaped Paths in Grids in CoRR (2012). abs/1204.5702
-
The vertex leafage of chordal graphs in CoRR (2011). abs/1104.2524