default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven Chaplick
Person information
- affiliation: Maastricht University, The Netherlands
SPARQL queries 
🛈 Please note that only 67% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j34]Steven Chaplick, Martin Frohn, Steven Kelk
, Johann Lottermoser, Matús Mihalák:
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. Discret. Appl. Math. 360: 275-281 (2025)- 2024
- [j33]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica 86(8): 2413-2447 (2024) - [j32]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. J. Graph Algorithms Appl. 28(1): 275-299 (2024) - [j31]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [c47]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with Few Biarcs. GD 2024: 11:1-11:16 - [c46]Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. SOFSEM 2024: 40-54 - [i48]Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. CoRR abs/2403.10868 (2024) - [i47]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2408.14299 (2024) - [i46]David Mestel, Steven Chaplick, Steven Kelk, Ruben Meuwese:
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. CoRR abs/2409.18634 (2024) - 2023
- [j30]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - [j29]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023) - [j28]Steven Chaplick:
Intersection graphs of non-crossing paths. Discret. Math. 346(8): 113498 (2023) - [j27]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27(6): 459-488 (2023) - [c45]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: A Treewidth Story. WG 2023: 187-200 - [i45]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: a Treewidth Story. CoRR abs/2302.10662 (2023) - [i44]Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. CoRR abs/2309.01110 (2023) - 2022
- [j26]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. J. Graph Algorithms Appl. 26(3): 307-334 (2022) - [j25]Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919: 66-74 (2022) - [c44]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. SoCG 2022: 26:1-26:16 - [c43]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [c42]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. GD 2022: 175-187 - [c41]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. GD 2022: 389-403 - [c40]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. MFCS 2022: 10:1-10:15 - [i43]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. CoRR abs/2203.05364 (2022) - [i42]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. CoRR abs/2205.05627 (2022) - [i41]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - [i40]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. CoRR abs/2208.12548 (2022) - [i39]Susanne Bleisch, Steven Chaplick, Jan-Henrik Haunert, Eva Mayr, Marc J. van Kreveld, Annika Bonerath:
Set Visualization and Uncertainty (Dagstuhl Seminar 22462). Dagstuhl Reports 12(11): 66-95 (2022) - 2021
- [j24]Steven Chaplick, Martin Töpfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. Algorithmica 83(11): 3281-3318 (2021) - [j23]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35(2): 840-892 (2021) - [j22]Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan:
Query minimization under stochastic uncertainty. Theor. Comput. Sci. 895: 75-95 (2021) - [c39]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c38]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. GD 2021: 3-17 - [c37]Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan:
Generalized Disk Graphs. WADS 2021: 115-128 - [c36]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. WADS 2021: 271-285 - [i38]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR abs/2102.02013 (2021) - [i37]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR abs/2105.08124 (2021) - [i36]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. CoRR abs/2112.03040 (2021) - 2020
- [j21]Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul:
On independent set in B1-EPG graphs. Discret. Appl. Math. 278: 62-72 (2020) - [j20]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24(4): 621-655 (2020) - [j19]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Recognizing Stick Graphs with and without Length Constraints. J. Graph Algorithms Appl. 24(4): 657-681 (2020) - [j18]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing graphs on few lines and few planes. J. Comput. Geom. 11(1): 433-475 (2020) - [c35]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. GD 2020: 205-219 - [c34]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. IPEC 2020: 8:1-8:15 - [c33]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization Under Stochastic Uncertainty. LATIN 2020: 181-193 - [c32]Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c31]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - [i35]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i34]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR abs/2003.04740 (2020) - [i33]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2003.05332 (2020) - [i32]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. CoRR abs/2008.07834 (2020) - [i31]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization under Stochastic Uncertainty. CoRR abs/2010.03517 (2020) - [i30]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. CoRR abs/2011.11670 (2020) - [i29]Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. CoRR abs/2012.08631 (2020) - [i28]Steven Chaplick, Takayuki Itoh, Giuseppe Liotta, Kwan-Liu Ma, Ignaz Rutter:
Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). NII Shonan Meet. Rep. 2020 (2020)
2010 – 2019
- 2019
- [j17]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84: 50-68 (2019) - [j16]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending partial representations of circle graphs. J. Graph Theory 91(4): 365-394 (2019) - [c30]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - [c29]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. GD 2019: 3-17 - [c28]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. GD 2019: 63-77 - [c27]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. GD 2019: 216-229 - [c26]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS 2019: 296-310 - [c25]Steven Chaplick:
Intersection Graphs of Non-crossing Paths. WG 2019: 311-324 - [i27]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. CoRR abs/1903.07595 (2019) - [i26]Steven Chaplick:
Intersection Graphs of Non-crossing Paths. CoRR abs/1907.00272 (2019) - [i25]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. CoRR abs/1907.05257 (2019) - [i24]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. CoRR abs/1907.08121 (2019) - 2018
- [j15]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. Algorithmica 80(8): 2286-2323 (2018) - [j14]Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some graphs with a unique perfect matching. Inf. Process. Lett. 139: 60-63 (2018) - [j13]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1): 108-129 (2018) - [j12]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - [j11]Steven Chaplick, Stefan Felsner, Udo Hoffmann, Veit Wiechert:
Grid Intersection Graphs and Order Dimension. Order 35(2): 363-391 (2018) - [c24]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. ESA 2018: 17:1-17:15 - [c23]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. GD 2018: 137-151 - [c22]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Brief Announcement: Approximation Schemes for Geometric Coverage Problems. ICALP 2018: 107:1-107:4 - [i23]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1806.10044 (2018) - [i22]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. CoRR abs/1812.04263 (2018) - 2017
- [j10]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-coloring and unit-cube contact representation of planar graphs. Discret. Appl. Math. 216: 2-14 (2017) - [j9]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max point-tolerance graphs. Discret. Appl. Math. 216: 84-97 (2017) - [j8]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j7]Steven Chaplick, Peter Zeman:
Combinatorial Problems on H-graphs. Electron. Notes Discret. Math. 61: 223-229 (2017) - [c21]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - [c20]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - [c19]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. GD 2017: 546-559 - [c18]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - [c17]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS 2017: 265-276 - [c16]Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. WG 2017: 167-179 - [i21]Steven Chaplick, Peter Zeman:
Combinatorial Problems on $H$-graphs. CoRR abs/1706.00575 (2017) - [i20]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - [i19]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. CoRR abs/1708.08723 (2017) - [i18]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - [i17]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. CoRR abs/1708.09233 (2017) - [i16]Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some Graphs with a Unique Perfect Matching. CoRR abs/1712.04228 (2017) - 2016
- [j6]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge intersection graphs of L-shaped paths in grids. Discret. Appl. Math. 210: 185-194 (2016) - [j5]Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert:
A Note on Concurrent Graph Sharing Games. Integers 16: G1 (2016) - [c15]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. GD 2016: 166-180 - [c14]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. GD 2016: 266-279 - [c13]Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. GD 2016: 295-308 - [c12]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [i15]Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. CoRR abs/1607.00278 (2016) - [i14]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.01196 (2016) - [i13]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.06444 (2016) - [i12]Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. CoRR abs/1607.06665 (2016) - [i11]Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. CoRR abs/1608.02389 (2016) - [i10]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - 2015
- [j4]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590: 86-95 (2015) - [i9]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. CoRR abs/1508.03062 (2015) - [i8]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max Point-Tolerance Graphs. CoRR abs/1508.03810 (2015) - [i7]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. CoRR abs/1512.00174 (2015) - 2014
- [j3]Steven Chaplick, Juraj Stacho:
The vertex leafage of chordal graphs. Discret. Appl. Math. 168: 14-25 (2014) - [c11]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - [c10]Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho:
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG 2014: 139-151 - [i6]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR abs/1408.6676 (2014) - 2013
- [j2]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge Intersection Graphs of L-Shaped Paths in Grids. Electron. Notes Discret. Math. 44: 363-369 (2013) - [j1]Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl. 17(4): 475-494 (2013) - [c9]Steven Chaplick, Elad Cohen, Gila Morgenstern:
Stabbing Polygonal Chains with Rays is Hard to Approximate. CCCG 2013 - [c8]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT 2013: 121-132 - [c7]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending Partial Representations of Circle Graphs. GD 2013: 131-142 - [c6]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. WG 2013: 26-37 - [c5]Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt:
Equilateral L-Contact Graphs. WG 2013: 139-151 - [i5]Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt:
Equilateral L-Contact Graphs. CoRR abs/1303.1279 (2013) - [i4]Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending Partial Representations of Circle Graphs. CoRR abs/1309.2399 (2013) - 2012
- [b1]Steven Chaplick:
Path Graphs and PR-trees. University of Toronto, Canada, 2012 - [c4]Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. GD 2012: 174-186 - [c3]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG 2012: 274-285 - [i3]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR abs/1204.5702 (2012) - [i2]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. CoRR abs/1206.5159 (2012) - 2011
- [c2]Steven Chaplick, Elad Cohen, Juraj Stacho:
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. WG 2011: 319-330 - [i1]Steven Chaplick, Juraj Stacho:
The vertex leafage of chordal graphs. CoRR abs/1104.2524 (2011) - 2010
- [c1]Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato:
From Path Graphs to Directed Path Graphs. WG 2010: 256-265
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
