piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    Dr. Steven Chaplick

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    D-97074 Würzburg

    Room: E12

    Phone: +49 (0) 931-31-88744

    Email: steven.chaplick@uni-wuerzburg.de

    Teaching

    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

    2019

    • Chaplick, S.: Intersection Graphs of Non-crossing Paths. In: Sau, I. and Thilikos, D.M. (eds.) Graph-Theoretic Concepts in Computer Science. p. 311--324. Springer International Publishing, Cham (2019).
       
    • Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1-planar graphs with right-angle crossings and few bends. Computational Geometry: Theory and Applications. 84, 50-68 (2019).
       
    • Chaplick, S., Fomin, F.V., Golovach, P.A., Knop, D., Zeman, P.: Kernelization of Graph Hamiltonicity: Proper H-Graphs. In: Friggstad, Z., Sack, J.-R., and Salavatipour, M.R. (eds.) WADS. p. 296--310. Springer, Cham (2019).
       
    • Angelini, P., Chaplick, S., Cornelsen, S., Lozzo, G.D., Roselli, V.: Morphing Contact Representations of Graphs. In: Barequet, G. and Wang, Y. (eds.) 35th International Symposium on Computational Geometry (SoCG 2019). p. 10:1--10:16. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019).
       

    2018

    • Cameron, K., Chaplick, S., Hoàng, C.T.: On the structure of (pan, even hole)-free graphs. Journal of Graph Theory. 87, 108--129 (2018).
       
    • Chaplick, S., De, M., Ravsky, A., Spoerhase, J.: Approximation Schemes for Geometric Coverage Problems. In: Azar, Y., Bast, H., and Herman, G. (eds.) Proc. 26th Annual European Symposium on Algorithms (ESA'18). p. 17:1--17:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018).
       
    • Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. In: Biedl, T.C. and Kerren, A. (eds.) Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings. p. 137--151. Springer (2018).
       
    • Chaplick, S., Fürst, M., Maffray, F., Rautenbach, D.: On some graphs with a unique perfect matching. Information Processing Letters. 139, 60--63 (2018).
       
    • Chaplick, S., Felsner, S., Hoffmann, U., Wiechert, V.: Grid Intersection Graphs and Order Dimension. Order. 35, 363--391 (2018).
       
    • Chaplick, S., Gu'spiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The Partial Visibility Representation Extension Problem. Algorithmica. 80, 2286--2323 (2018).
       
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., Stehn, F.: Placing your Coins on a Shelf. JoCG. 9, 312--327 (2018).
       

    2017

    • Catanzaro, D., Chaplick, S., Felsner, S., Halldórsson, B.V., Halldórsson, M.M., Hixon, T., Stacho, J.: Max point-tolerance graphs. Discrete Applied Mathematics. 216, 84--97 (2017).
       
    • Alam, M.J., Chaplick, S., Fijavz, G., Kaufmann, M., Kobourov, S.G., Pupyrev, S., Toeniskoetter, J.: Threshold-coloring and unit-cube contact representation of planar graphs. Discrete Applied Mathematics. 216, 2--14 (2017).
       
    • Chaplick, S., Zeman, P.: Combinatorial Problems on H -graphs. Electronic Notes in Discrete Mathematics. 61, 223--229 (2017).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes. In: Ellen, F., Kolokolova, A., and Sack, J.-R. (eds.) Proc. Algorithms Data Struct. Symp. (WADS'17). p. 265--276. Springer, Cham (2017).
       
    • Angelini, P., Chaplick, S., De Luca, F., Fiala, J., Hanvcl, J., Heinsohn, N., Kaufmann, M., Kobourov, S., Kratochvíl, J., Valtr, P.: On Vertex- and Empty-Ply Proximity Drawings. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17). p. 24--37. Springer International Publishing, Cham (2017).
       
    • Chaplick, S., Töpfer, M., Voborník, J., Zeman, P.: On H-Topological Intersection Graphs. In: Bodlaender, H.L. and Woeginger, G.J. (eds.) Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. p. 167--179. Springer International Publishing, Cham (2017).
       
    • Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I.G., Wolff, A.: Planar L-Drawings of Directed Graphs. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17). p. 465--478. Springer International Publishing, Cham (2017).
       
    • Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., Uehara, R.: Ferrers dimension of grid intersection graphs. Discrete Applied Mathematics. 216, 130--135 (2017).
       
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., Stehn, F.: Placing your Coins on a Shelf. In: Okamoto, Y. and Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). p. 4:1--4:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017).
       
    • Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond Outerplanarity. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17). p. 546--559. Springer International Publishing, Cham (2017).
       

    2016

    • Cameron, K., Chaplick, S., Hoàng, C.'inh T.: Edge intersection graphs of L-shaped paths in grids. Discrete Applied Mathematics. 210, 185--194 (2016).
       
    • Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The Partial Visibility Representation Extension Problem. In: Hu, Y. and Nöllenburg, M. (eds.) Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. p. 266--279. Springer (2016).
       
    • Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Di Battista, G., Eades, P., Kindermann, P., Kratochv'il, J., Lipp, F., Rutter, I.: Simultaneous Orthogonal Planarity. In: Hu, Y. and Nöllenburg, M. (eds.) Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. p. 532--545. Springer (2016).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. In: Hu, Y. and Nöllenburg, M. (eds.) Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. p. 166--180. Springer (2016).
       
    • Chaplick, S., Lipp, F., Park, J.-W., Wolff, A.: Obstructing Visibilities with One Obstacle. In: Hu, Y. and Nöllenburg, M. (eds.) Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. p. 295--308. Springer (2016).
       
    • Chaplick, S., Micek, P., Ueckerdt, T., Wiechert, V.: A note on concurrent graph sharing games. Integers. 16, Paper No. G1 (2016).
       

    2015

    • Chaplick, S., Fiala, J.'i, van 't Hof, P., Paulusma, D., Tesar, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86--95 (2015).
       

    2014

    • Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discrete Applied Mathematics. 168, 14--25 (2014).
       
    • Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., Uehara, R.: Intersection Dimension of Bipartite Graphs. In: Gopal, T.V., Agrawal, M., Li, A., and Cooper, S.B. (eds.) Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. p. 323--340. Springer (2014).
       
    • Chaplick, S., Dorbec, P., Kratochv'il, J., Montassier, M., Stacho, J.: Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. In: Kratsch, D. and Todinca, I. (eds.) Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers. p. 139--151. Springer (2014).
       

    2013

    • Alam, M.J., Chaplick, S., Fijavz, G., Kaufmann, M., Kobourov, S.G., Pupyrev, S.: Threshold-Coloring and Unit-Cube Contact Representation of Graphs. In: Brandstädt, A., Jansen, K., and Reischuk, R. (eds.) Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. p. 26--37. Springer (2013).
       
    • Chaplick, S., Kobourov, S.G., Ueckerdt, T.: Equilateral L-Contact Graphs. In: Brandstädt, A., Jansen, K., and Reischuk, R. (eds.) Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. p. 139--151. Springer (2013).
       
    • Chaplick, S., Ueckerdt, T.: Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl. 17, 475--494 (2013).
       
    • Chaplick, S., Cohen, E., Morgenstern, G.: Stabbing Polygonal Chains with Rays is Hard to Approximate. Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013. Carleton University, Ottawa, Canada (2013).
       
    • Chaplick, S., Fulek, R., Klav'ik, P.: Extending Partial Representations of Circle Graphs. In: Wismath, S.K. and Wolff, A. (eds.) Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers. p. 131--142. Springer (2013).
       
    • Cameron, K., Chaplick, S., Hoàng, C.'inh T.: Edge Intersection Graphs of L-Shaped Paths in Grids. Electronic Notes in Discrete Mathematics. 44, 363--369 (2013).
       
    • Chaplick, S., Fiala, J.'i, van 't Hof, P., Paulusma, D., Tesar, M.: Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. In: Gasieniec, L. and Wolter, F. (eds.) Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings. p. 121--132. Springer (2013).
       

    2012

    • Chaplick, S., Ueckerdt, T.: Planar Graphs as VPG-Graphs. In: Didimo, W. and Patrignani, M. (eds.) Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. p. 174--186. Springer (2012).
       
    • Chaplick, S., Jel'inek, V.'it, Kratochv'il, J., Vyskocil, T.: Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. In: Golumbic, M.C., Stern, M., Levy, A., and Morgenstern, G. (eds.) Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. p. 274--285. Springer (2012).
       

    2011

    • Chaplick, S., Cohen, E., Stacho, J.: Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. In: Kolman, P. and Kratochv'il, J. (eds.) Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. p. 319--330. Springer (2011).
       

    2010

    • Chaplick, S., Gutierrez, M., Lévêque, B., Tondato, S.B.: From Path Graphs to Directed Path Graphs. In: Thilikos, D.M. (ed.) Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. p. 256--265 (2010).
       

    Preprints / Tech Reports

    2019

    • Chaplick, S., Förster, H., Kryven, M., Wolff, A.: On Arrangements of Orthogonal Circles, http://arxiv.org/abs/1907.08121, (2019).
       
    • Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Roselli, V.: Morphing Contact Representations of Graphs, http://arxiv.org/abs/1903.07595, (2019).
       
    • Chaplick, S.: Intersection Graphs of Non-crossing Paths, http://arxiv.org/abs/1907.00272, (2019).
       
    • Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints, http://arxiv.org/abs/1907.05257, (2019).
       

    2018

    • Chaplick, S., van Dijk, T.C., Kryven, M., won Park, J., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. CoRR. abs/1812.04263, (2018).
       
    • Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR. abs/1806.10044, (2018).
       

    2017

    • Angelini, P., Chaplick, S., Luca, F.D., Fiala, J.'i, Jr., J.H., Heinsohn, N., Kaufmann, M., Kobourov, S.G., Kratochv'il, J., Valtr, P.: On Vertex- and Empty-Ply Proximity Drawings. CoRR. abs/1708.09233, (2017).
       
    • Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I.G., Wolff, A.: Planar L-Drawings of Directed Graphs. CoRR. abs/1708.09107, (2017).
       
    • Chaplick, S., Fürst, M., Maffray, F., Rautenbach, D.: On some Graphs with a Unique Perfect Matching, http://arxiv.org/abs/1712.04228, (2017).
       
    • Chaplick, S., Zeman, P.: Combinatorial Problems on \($H$\)-graphs, http://arxiv.org/abs/1706.00575, (2017).
       
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., Stehn, F.: Placing your Coins on a Shelf. CoRR. abs/1707.01239, (2017).
       
    • Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond Outerplanarity. CoRR. abs/1708.08723, (2017).
       

    2016

    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR. abs/1607.06444, (2016).
       
    • Chaplick, S., De, M., Ravsky, A., Spoerhase, J.: Approximation Schemes for Geometric Coverage Problems. CoRR. abs/1607.06665, (2016).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. CoRR. abs/1607.01196, (2016).
       
    • Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Di Battista, G., Eades, P., Kindermann, P., Kratochv'il, J., Lipp, F., Rutter, I.: Simultaneous Orthogonal Planarity. CoRR. abs/1608.08427, (2016).
       
    • Chaplick, S., Toepfer, M., Voborn'ik, J., Zeman, P.: On H-Topological Intersection Graphs. CoRR. abs/1608.02389, (2016).
       
    • Chaplick, S., Lipp, F., Park, J.-W., Wolff, A.: Obstructing Visibilities with One Obstacle. CoRR. abs/1607.00278, (2016).
       

    2015

    • Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The Partial Visibility Representation Extension Problem. CoRR. abs/1512.00174, (2015).
       
    • Catanzaro, D., Chaplick, S., Felsner, S., Halldórsson, B.V., Halldórsson, M.M., Hixon, T., Stacho, J.: Max Point-Tolerance Graphs. CoRR. abs/1508.03810, (2015).
       
    • Chaplick, S., Felsner, S., Hoffmann, U., Wiechert, V.: Grid Intersection Graphs and Order Dimension. (2015).
       
    • Cameron, K., Chaplick, S., Hoàng, C.'inh T.: On the structure of (pan, even hole)-free graphs. CoRR. abs/1508.03062, (2015).
       

    2014

    • Chaplick, S., Fiala, J.'i, van 't Hof, P., Paulusma, D., Tesar, M.: Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR. abs/1408.6676, (2014).
       
    • Chaplick, S., Micek, P., Ueckerdt, T., Wiechert, V.: A note on concurrent graph sharing games. (2014).
       

    2013

    • Chaplick, S., Kobourov, S.G., Ueckerdt, T.: Equilateral L-Contact Graphs. CoRR. abs/1303.1279, (2013).
       
    • Chaplick, S., Fulek, R., Klav'ik, P.: Extending Partial Representations of Circle Graphs. CoRR. abs/1309.2399, (2013).
       

    2012

    • Chaplick, S., Jel'inek, V.'it, Kratochv'il, J., Vyskocil, T.: Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. CoRR. abs/1206.5159, (2012).
       
    • Cameron, K., Chaplick, S., Hoàng, C.'inh T.: Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR. abs/1204.5702, (2012).
       

    2011

    • Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. CoRR. abs/1104.2524, (2011).