piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Dr. Steven Chaplick

    I have moved to Maastricht University! 

    See my new webpage: https://www.maastrichtuniversity.nl/p70068141

     

     

    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[ to top ]
    • Chaplick, S. Intersection Graphs of Non-crossing Paths. In I. Sau & D. M. Thilikos (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 311-324). Springer International Publishing. https://doi.org/10.1007/978-3-030-30786-8_24
    • 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. https://doi.org/https://doi.org/10.1016/j.comgeo.2019.07.006
    • Chaplick, S., Fomin, F. V., Golovach, P. A., Knop, D., & Zeman, P. Kernelization of Graph Hamiltonicity: Proper H-Graphs. In Z. Friggstad, J.-R. Sack, & M. R. Salavatipour (Eds.), WADS (pp. 296-310). Springer. https://doi.org/10.1007/978-3-030-24766-9_22
    • Angelini, P., Chaplick, S., Cornelsen, S., Lozzo, G. D., & Roselli, V. Morphing Contact Representations of Graphs. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry (SoCG 2019) (Vols. 129, pp. 10:1-10:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2019.10
    2018[ to top ]
    • Cameron, K., Chaplick, S., & Hoàng, C. T. On the structure of (pan, even hole)-free graphs. Journal of Graph Theory, 87(1), 108-129. https://doi.org/10.1002/jgt.22146
    • Chaplick, S., De, M., Ravsky, A., & Spoerhase, J. Approximation Schemes for Geometric Coverage Problems. In Y. Azar, H. Bast, & G. Herman (Eds.), Proc. 26th Annual European Symposium on Algorithms (ESA’18) (Vols. 112, pp. 17:1-17:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2018.17
    • Chaplick, S., Lipp, F., Wolff, A., & Zink, J. Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. In T. C. Biedl & A. Kerren (Eds.), Graph Drawing and Network Visualization - 26th International Symposium, {GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings (Vols. 11282, pp. 137-151). Springer. https://doi.org/10.1007/978-3-030-04414-5\_10
    • Chaplick, S., Fürst, M., Maffray, F., & Rautenbach, D. On some graphs with a unique perfect matching. Information Processing Letters, 139, 60-63. https://doi.org/https://doi.org/10.1016/j.ipl.2018.07.008
    • Chaplick, S., Felsner, S., Hoffmann, U., & Wiechert, V. Grid Intersection Graphs and Order Dimension. Order, 35(2), 363-391. https://doi.org/10.1007/s11083-017-9437-0
    • Chaplick, S., Gu{\’{s}}piel, G., Gutowski, G., Krawczyk, T., & Liotta, G. The Partial Visibility Representation Extension Problem. Algorithmica, 80(8), 2286-2323. https://doi.org/10.1007/s00453-017-0322-4
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., & Stehn, F. Placing your Coins on a Shelf. JoCG, 9(1), 312-327. http://jocg.org/index.php/jocg/article/view/361
    2017[ to top ]
    • Catanzaro, D., Chaplick, S., Felsner, S., Halld{\’{o}}rsson, B. V., Halld{\’{o}}rsson, M. M., Hixon, T., & Stacho, J. Max point-tolerance graphs. Discrete Applied Mathematics, 216, 84-97. https://doi.org/10.1016/j.dam.2015.08.019
    • 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. https://doi.org/10.1016/j.dam.2015.09.003
    • Chaplick, S., & Zeman, P. Combinatorial Problems on H -graphs. Electronic Notes in Discrete Mathematics, 61, 223-229. https://doi.org/10.1016/j.endm.2017.06.042
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., & Wolff, A. The Complexity of Drawing Graphs on Few Lines and Few Planes. In F. Ellen, A. Kolokolova, & J.-R. Sack (Eds.), Proc. Algorithms Data Struct. Symp. (WADS’17) (pp. 265-276). Springer. https://doi.org/10.1007/978-3-319-62127-2_23
    • Angelini, P., Chaplick, S., De Luca, F., Fiala, J., Han{\v{c}}l, J., Heinsohn, N., Kaufmann, M., Kobourov, S., Kratochv{\’i}l, J., & Valtr, P. On Vertex- and Empty-Ply Proximity Drawings. In F. Frati & K.-L. Ma (Eds.), Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17) (Vols. 10692, pp. 24-37). Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_3
    • Chaplick, S., T{\"o}pfer, M., Voborn{\’i}k, J., & Zeman, P. On H-Topological Intersection Graphs. In H. L. Bodlaender & G. J. Woeginger (Eds.), Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers (pp. 167-179). Springer International Publishing. https://doi.org/10.1007/978-3-319-68705-6_13
    • Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., N{\"o}llenburg, M., Patrignani, M., Tollis, I. G., & Wolff, A. Planar L-Drawings of Directed Graphs. In F. Frati & K.-L. Ma (Eds.), Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17) (Vols. 10692, pp. 465-478). Springer International Publishing. https://doi.org/978-3-319-73915-1_36
    • Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., & Uehara, R. Ferrers dimension of grid intersection graphs. Discrete Applied Mathematics, 216, 130-135. https://doi.org/10.1016/j.dam.2015.05.035
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., & Stehn, F. Placing your Coins on a Shelf. In Y. Okamoto & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (Vols. 92, pp. 4:1-4:12). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2017.4
    • Chaplick, S., Kryven, M., Liotta, G., Löffler, A., & Wolff, A. Beyond Outerplanarity. In F. Frati & K.-L. Ma (Eds.), Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17) (Vols. 10692, pp. 546-559). Springer International Publishing. https://doi.org/978-3-319-73915-1_42
    2016[ to top ]
    • Cameron, K., Chaplick, S., & Ho{\`{a}}ng, C. T. Edge intersection graphs of L-shaped paths in grids. Discrete Applied Mathematics, 210, 185-194. https://doi.org/10.1016/j.dam.2015.01.039
    • Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., & Liotta, G. The Partial Visibility Representation Extension Problem. In Y. Hu & M. N{\"{o}}llenburg (Eds.), Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (Vols. 9801, pp. 266-279). Springer. https://doi.org/10.1007/978-3-319-50106-2_21
    • Angelini, P., Chaplick, S., Cornelsen, S., {Da Lozzo}, G., {Di Battista}, G., Eades, P., Kindermann, P., Kratochv{\’{\i}}l, J., Lipp, F., & Rutter, I. Simultaneous Orthogonal Planarity. In Y. Hu & M. N{\"{o}}llenburg (Eds.), Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (Vols. 9801, pp. 532-545). Springer. https://doi.org/10.1007/978-3-319-50106-2_41
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., & Wolff, A. Drawing Graphs on Few Lines and Few Planes. In Y. Hu & M. N{\"{o}}llenburg (Eds.), Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (Vols. 9801, pp. 166-180). Springer. https://doi.org/10.1007/978-3-319-50106-2_14
    • Chaplick, S., Lipp, F., Park, J.- }Won, & Wolff, A. Obstructing Visibilities with One Obstacle. In Y. Hu & M. N{\"{o}}llenburg (Eds.), Graph Drawing and Network Visualization - 24th International Symposium, {GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (Vols. 9801, pp. 295-308). Springer. https://doi.org/10.1007/978-3-319-50106-2_23
    • Chaplick, S., Micek, P., Ueckerdt, T., & Wiechert, V. A note on concurrent graph sharing games. Integers, 16, Paper No. G1. http://www.emis.de/journals/INTEGERS/papers/qg1/qg1.pdf
    2015[ to top ]
    • Chaplick, S., Fiala, J., 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. https://doi.org/10.1016/j.tcs.2015.01.028
    2014[ to top ]
    • Chaplick, S., & Stacho, J. The vertex leafage of chordal graphs. Discrete Applied Mathematics, 168, 14-25. https://doi.org/10.1016/j.dam.2012.12.006
    • Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., & Uehara, R. Intersection Dimension of Bipartite Graphs. In T. V. Gopal, M. Agrawal, A. Li, & S. B. Cooper (Eds.), Theory and Applications of Models of Computation - 11th Annual Conference, {TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings (Vols. 8402, pp. 323-340). Springer. https://doi.org/10.1007/978-3-319-06089-7_23
    • Chaplick, S., Dorbec, P., Kratochv{\’{\i}}l, J., Montassier, M., & Stacho, J. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. In D. Kratsch & I. Todinca (Eds.), Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers (Vols. 8747, pp. 139-151). Springer. https://doi.org/10.1007/978-3-319-12340-0_12
    2013[ to top ]
    • Alam, M. J., Chaplick, S., Fijavz, G., Kaufmann, M., Kobourov, S. G., & Pupyrev, S. Threshold-Coloring and Unit-Cube Contact Representation of Graphs. In A. Brandst{\"{a}}dt, K. Jansen, & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers (Vols. 8165, pp. 26-37). Springer. https://doi.org/10.1007/978-3-642-45043-3_4
    • Chaplick, S., Kobourov, S. G., & Ueckerdt, T. Equilateral L-Contact Graphs. In A. Brandst{\"{a}}dt, K. Jansen, & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers (Vols. 8165, pp. 139-151). Springer. https://doi.org/10.1007/978-3-642-45043-3_13
    • Chaplick, S., & Ueckerdt, T. Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl., 17(4), 475-494. https://doi.org/10.7155/jgaa.00300
    • 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. http://cccg.ca/proceedings/2013/papers/paper_50.pdf
    • Chaplick, S., Fulek, R., & Klav{\’{\i}}k, P. Extending Partial Representations of Circle Graphs. In S. K. Wismath & A. Wolff (Eds.), Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers (Vols. 8242, pp. 131-142). Springer. https://doi.org/10.1007/978-3-319-03841-4_12
    • Cameron, K., Chaplick, S., & Ho{\`{a}}ng, C. T. Edge Intersection Graphs of L-Shaped Paths in Grids. Electronic Notes in Discrete Mathematics, 44, 363-369. https://doi.org/10.1016/j.endm.2013.10.057
    • Chaplick, S., Fiala, J., van ’t Hof, P., Paulusma, D., & Tesar, M. Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. In L. Gasieniec & F. Wolter (Eds.), Fundamentals of Computation Theory - 19th International Symposium, {FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings (Vols. 8070, pp. 121-132). Springer. https://doi.org/10.1007/978-3-642-40164-0_14
    2012[ to top ]
    • Chaplick, S., & Ueckerdt, T. Planar Graphs as VPG-Graphs. In W. Didimo & M. Patrignani (Eds.), Graph Drawing - 20th International Symposium, {GD} 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers (Vols. 7704, pp. 174-186). Springer. https://doi.org/10.1007/978-3-642-36763-2_16
    • Chaplick, S., Jel{\’{\i}}nek, V., Kratochv{\’{\i}}l, J., & Vyskocil, T. Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. In M. C. Golumbic, M. Stern, A. Levy, & G. Morgenstern (Eds.), Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (Vols. 7551, pp. 274-285). Springer. https://doi.org/10.1007/978-3-642-34611-8_28
    2011[ to top ]
    • Chaplick, S., Cohen, E., & Stacho, J. Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. In P. Kolman & J. Kratochv{\’{\i}}l (Eds.), Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\’{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers (Vols. 6986, pp. 319-330). Springer. https://doi.org/10.1007/978-3-642-25870-1_29
    2010[ to top ]
    • Chaplick, S., Gutierrez, M., L{\’{e}}v{\^{e}}que, B., & Tondato, S. B. From Path Graphs to Directed Path Graphs. In D. M. Thilikos (Ed.), Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\’{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers (Vols. 6410, pp. 256-265). https://doi.org/10.1007/978-3-642-16926-7_24

    Preprints / Tech Reports

    2019[ to top ]
    • Chaplick, S., Förster, H., Kryven, M., & Wolff, A. On Arrangements of Orthogonal Circles. http://arxiv.org/abs/1907.08121
    • Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., & Roselli, V. Morphing Contact Representations of Graphs. http://arxiv.org/abs/1903.07595
    • Chaplick, S. Intersection Graphs of Non-crossing Paths. http://arxiv.org/abs/1907.00272
    • 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
    2018[ to top ]
    • Chaplick, S., van Dijk, T. C., Kryven, M., won Park, J., Ravsky, A., & Wolff, A. Bundled Crossings Revisited. CoRR, abs/1812.04263. http://arxiv.org/abs/1812.04263
    • 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. http://arxiv.org/abs/1806.10044
    2017[ to top ]
    • Angelini, P., Chaplick, S., Luca, F. D., Fiala, J., Jr., J. H., Heinsohn, N., Kaufmann, M., Kobourov, S. G., Kratochv{\’{\i}}l, J., & Valtr, P. On Vertex- and Empty-Ply Proximity Drawings. CoRR, abs/1708.09233. http://arxiv.org/abs/1708.09233
    • Chaplick, S., Chimani, M., Cornelsen, S., {Da Lozzo}, G., N{\"{o}}llenburg, M., Patrignani, M., Tollis, I. G., & Wolff, A. Planar L-Drawings of Directed Graphs. CoRR, abs/1708.09107. http://arxiv.org/abs/1708.09107
    • Chaplick, S., Fürst, M., Maffray, F., & Rautenbach, D. On some Graphs with a Unique Perfect Matching. http://arxiv.org/abs/1712.04228
    • Chaplick, S., & Zeman, P. Combinatorial Problems on $H$-graphs. http://arxiv.org/abs/1706.00575
    • Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., & Stehn, F. Placing your Coins on a Shelf. CoRR, abs/1707.01239. http://dblp.uni-trier.de/db/journals/corr/corr1707.html#AltBCCKKS17
    • Chaplick, S., Kryven, M., Liotta, G., Löffler, A., & Wolff, A. Beyond Outerplanarity. CoRR, abs/1708.08723. http://arxiv.org/abs/1708.08723
    2016[ to top ]
    • 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. http://arxiv.org/abs/1607.06444
    • Chaplick, S., De, M., Ravsky, A., & Spoerhase, J. Approximation Schemes for Geometric Coverage Problems. CoRR, abs/1607.06665. http://arxiv.org/abs/1607.06665
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., & Wolff, A. Drawing Graphs on Few Lines and Few Planes. CoRR, abs/1607.01196. http://arxiv.org/abs/1607.01196
    • Angelini, P., Chaplick, S., Cornelsen, S., {Da Lozzo}, G., {Di Battista}, G., Eades, P., Kindermann, P., Kratochv{\’{\i}}l, J., Lipp, F., & Rutter, I. Simultaneous Orthogonal Planarity. CoRR, abs/1608.08427. http://arxiv.org/abs/1608.08427
    • Chaplick, S., Toepfer, M., Voborn{\’{\i}}k, J., & Zeman, P. On H-Topological Intersection Graphs. CoRR, abs/1608.02389. http://arxiv.org/abs/1608.02389
    • Chaplick, S., Lipp, F., Park, J.- }Won, & Wolff, A. Obstructing Visibilities with One Obstacle. CoRR, abs/1607.00278. http://arxiv.org/abs/1607.00278
    2015[ to top ]
    • Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., & Liotta, G. The Partial Visibility Representation Extension Problem. CoRR, abs/1512.00174. http://arxiv.org/abs/1512.00174
    • Catanzaro, D., Chaplick, S., Felsner, S., Halld{\’{o}}rsson, B. V., Halld{\’{o}}rsson, M. M., Hixon, T., & Stacho, J. Max Point-Tolerance Graphs. CoRR, abs/1508.03810. http://arxiv.org/abs/1508.03810
    • Chaplick, S., Felsner, S., Hoffmann, U., & Wiechert, V. Grid Intersection Graphs and Order Dimension. http://arxiv.org/abs/1512.02482
    • Cameron, K., Chaplick, S., & Ho{\`{a}}ng, C. T. On the structure of (pan, even hole)-free graphs. CoRR, abs/1508.03062. http://arxiv.org/abs/1508.03062
    2014[ to top ]
    • Chaplick, S., Fiala, J., van ’t Hof, P., Paulusma, D., & Tesar, M. Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR, abs/1408.6676. http://arxiv.org/abs/1408.6676
    • Chaplick, S., Micek, P., Ueckerdt, T., & Wiechert, V. A note on concurrent graph sharing games. http://arxiv.org/abs/1411.1021
    2013[ to top ]
    • Chaplick, S., Kobourov, S. G., & Ueckerdt, T. Equilateral L-Contact Graphs. CoRR, abs/1303.1279. http://arxiv.org/abs/1303.1279
    • Chaplick, S., Fulek, R., & Klav{\’{\i}}k, P. Extending Partial Representations of Circle Graphs. CoRR, abs/1309.2399. http://arxiv.org/abs/1309.2399
    2012[ to top ]
    • Chaplick, S., Jel{\’{\i}}nek, V., Kratochv{\’{\i}}l, J., & Vyskocil, T. Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. CoRR, abs/1206.5159. http://arxiv.org/abs/1206.5159
    • Cameron, K., Chaplick, S., & Ho{\`{a}}ng, C. T. Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR, abs/1204.5702. http://arxiv.org/abs/1204.5702
    2011[ to top ]
    • Chaplick, S., & Stacho, J. The vertex leafage of chordal graphs. CoRR, abs/1104.2524. http://arxiv.org/abs/1104.2524