Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ton Kloks
Antonius J. J. Kloks
2010 – today
- 2013
[c54]- [c53]Yue-Li Wang, Kuo-Hua Wu, Ton Kloks: On Perfect Absorbants in De Bruijn Digraphs. FAW-AAIM 2013: 303-314
- [c52]Jiawei Gao, Ton Kloks, Sheung-Hung Poon: Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs. WALCOM 2013: 194-205
- [i20]
- [i19]Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang: On independence domination. CoRR abs/1304.6450 (2013)
- [i18]Wing-Kai Hon, Ton Kloks, S. Liu, Sheung-Hung Poon, Yue-Li Wang: Independent set in categorical products of cographs and splitgraphs. CoRR abs/1305.4237 (2013)
- 2012
- [c51]Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang: The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs. FAW-AAIM 2012: 339-350
- [c50]Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang: Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs. COCOON 2012: 157-168
- [i17]
- [i16]
- [i15]
- [i14]
- [i13]Ton Kloks, Sheung-Hung Poon, Yue-Li Wang: The black-and-white coloring problem on circle graphs. CoRR abs/1202.1896 (2012)
- [i12]
- [i11]Maw-Shang Chang, Ton Kloks, Ching-Hao Liu: Edge-clique graphs of cocktail parties have unbounded rankwidth. CoRR abs/1205.2483 (2012)
- [i10]Maw-Shang Chang, Ton Kloks, Ching-Hao Liu: Independent sets in edge-clique graphs. CoRR abs/1206.1993 (2012)
- [i9]Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon: Independent sets in edge-clique graphs II. CoRR abs/1206.5082 (2012)
- [i8]
- [i7]
- [i6]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: On the threshold-width of graphs. CoRR abs/1210.8365 (2012)
- 2011
- [j47]
- [j46]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: On the threshold-width of graphs. J. Graph Algorithms Appl. 15(2): 253-268 (2011)
- [j45]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: Block-graph width. Theor. Comput. Sci. 412(23): 2496-2502 (2011)
- [c49]Ling-Ju Hung, Ton Kloks, Fernando Sanchez Villaamil: Black-and-White Threshold Graphs. CATS 2011: 121-130
- [c48]Mingyu Xiao, Ton Kloks, Sheung-Hung Poon: New Parameterized Algorithms for the Edge Dominating Set Problem. MFCS 2011: 604-615
- [i5]Mingyu Xiao, Ton Kloks, Sheung-Hung Poon: New parameterized algorithms for edge dominating set. CoRR abs/1104.4160 (2011)
- [i4]Ton Kloks, Yue-Li Wang: A linear-time algorithm for the strong chromatic index of Halin graphs. CoRR abs/1109.3934 (2011)
- [i3]Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang: Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs. CoRR abs/1110.0583 (2011)
- [i2]Ton Kloks, Chin-Ting Ung, Yue-Li Wang: On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs. CoRR abs/1110.1693 (2011)
- [i1]Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang: The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs. CoRR abs/1111.0867 (2011)
- 2010
- [c47]
- [c46]
- [c45]
2000 – 2009
- 2009
- [j44]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: On probe permutation graphs. Discrete Applied Mathematics 157(12): 2611-2619 (2009)
- [j43]Ton Kloks, Haiko Müller, Kristina Vuskovic: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. J. Comb. Theory, Ser. B 99(5): 733-800 (2009)
- [c44]
- [c43]
- 2008
- [j42]Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Efficient algorithms for Roman domination on some classes of graphs. Discrete Applied Mathematics 156(18): 3400-3415 (2008)
- [j41]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Partitioned probe comparability graphs. Theor. Comput. Sci. 396(1-3): 212-222 (2008)
- [c42]David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng: Probe Ptolemaic Graphs. COCOON 2008: 468-477
- 2007
- [c41]David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier: Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377
- 2006
- [j40]Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu: Improved bottleneck domination algorithms. Discrete Applied Mathematics 154(11): 1578-1592 (2006)
- [c40]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. AAIM 2006: 267-278
- [c39]Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee: The Maximum Interval Graphs on Distance Hereditary Graphs. JCIS 2006
- [c38]David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng: On Probe Permutation Graphs. TAMC 2006: 494-504
- [c37]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Partitioned Probe Comparability Graphs. WG 2006: 179-190
- 2005
- [j39]Ton Kloks, Jan Kratochvíl, Haiko Müller: Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145(2): 266-275 (2005)
- [j38]Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng: Probe interval bigraphs. Electronic Notes in Discrete Mathematics 19: 195-201 (2005)
- [j37]Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005)
- [c36]Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng: On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. COCOON 2005: 808-817
- [c35]Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: The PIGs Full Monty - A Floor Show of Minimal Separators. STACS 2005: 521-532
- [c34]Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Roman Domination over Some Graph Classes. WG 2005: 103-114
- 2004
- [j36]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004)
- [j35]Ton Kloks, Chuan-Min Lee, Jiping Liu: Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. J. Inf. Sci. Eng. 20(2): 207-217 (2004)
- [c33]Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier: Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. WEA 2004: 87-99
- 2003
- [c32]Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller: On the Recognition of General Partition Graphs. WG 2003: 273-283
- 2002
- [j34]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002)
- [j33]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier: Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002)
- [c31]Ton Kloks, Chuan-Min Lee, Jiping Liu: New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. WG 2002: 282-295
- 2001
- [j32]Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-parameter complexity of lambda-labelings. Discrete Applied Mathematics 113(1): 59-72 (2001)
- [j31]Ton Kloks, Richard B. Tan: Bandwidth and topological bandwidth of graphs with few P4's. Discrete Applied Mathematics 115(1-3): 117-133 (2001)
- [j30]Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu: Efficient algorithms for graphs with few P4's. Discrete Mathematics 235(1-3): 29-51 (2001)
- [j29]Ton Kloks, Dieter Kratsch, Haiko Müller: On the Structure of Graphs with Bounded Asteroidal Number. Graphs and Combinatorics 17(2): 295-306 (2001)
- [c30]
- 2000
- [j28]Hajo Broersma, Elias Dahlhaus, Ton Kloks: A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discrete Applied Mathematics 99(1-3): 367-400 (2000)
- [j27]Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000)
- [j26]Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000)
- [c29]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: lambda-Coloring of Graphs. STACS 2000: 395-406
- [c28]Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller: Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
1990 – 1999
- 1999
- [j25]Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discrete Applied Mathematics 98(1-2): 39-63 (1999)
- [j24]Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier: SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electronic Notes in Discrete Mathematics 3: 19-26 (1999)
- [j23]Ton Kloks, Dieter Kratsch, Haiko Müller: On the structure of graphs with bounded asteroidal number. Electronic Notes in Discrete Mathematics 3: 94 (1999)
- [j22]Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999)
- [j21]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 12(2): 276-287 (1999)
- [c27]
- [c26]Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363
- 1998
- [j20]Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998)
- [j19]Ton Kloks, Dieter Kratsch, Haiko Müller: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998)
- [j18]Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998)
- [j17]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller: Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(2) (1998)
- [j16]Ton Kloks, Dieter Kratsch: Listing All Minimal Separators of a Graph. SIAM J. Comput. 27(3): 605-613 (1998)
- [j15]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Rankings of Graphs. SIAM J. Discrete Math. 11(1): 168-181 (1998)
- [c25]Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
- [c24]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG 1998: 88-99
- 1997
- [j14]Dieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. Discrete Applied Mathematics 77(3): 259-270 (1997)
- [j13]X. Cai, Ton Kloks, C. K. Wong: Time-varying shortest path problems with constraints. Networks 29(3): 141-150 (1997)
- [j12]Ton Kloks, Dieter Kratsch, Jeremy Spinrad: On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175(2): 309-335 (1997)
- [c23]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
- [c22]Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117
- [c21]
- 1996
- [j11]
- [j10]
- [j9]Hans L. Bodlaender, Ton Kloks: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms 21(2): 358-402 (1996)
- [c20]Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267
- [c19]Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182
- [c18]
- 1995
- [j8]Aart Blokhuis, Ton Kloks: On the Equivalence Covering Number of Splitgraphs. Inf. Process. Lett. 54(5): 301-304 (1995)
- [j7]Ton Kloks, Dieter Kratsch: Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Inf. Process. Lett. 55(1): 11-16 (1995)
- [j6]Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. J. Algorithms 18(2): 238-255 (1995)
- [j5]Ton Kloks, Dieter Kratsch: Treewidth of Chordal Bipartite Graphs. J. Algorithms 19(2): 266-281 (1995)
- [j4]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)
- [j3]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8(4): 606-616 (1995)
- [c17]Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447
- [c16]Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23
- 1994
- [b1]Ton Kloks: Treewidth, Computations and Approximations. Lecture Notes in Computer Science 842, Springer 1994, ISBN 3-540-58356-4
- [c15]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch: Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1994: 508
- [c14]Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
- [c13]
- [c12]
- [c11]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
- 1993
- [j2]Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993)
- [c10]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1993: 260-271
- [c9]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125
- [c8]
- [c7]
- 1992
- [c6]Ton Kloks, Hans L. Bodlaender: Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125
- [c5]Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS 1992: 415-423
- [c4]
- 1991
- [c3]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296
- [c2]Hans L. Bodlaender, Ton Kloks: Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555
- [c1]Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson: Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12
1980 – 1989
- 1989
- [j1]Ton Kloks: An infinite sequence of GammaDelta-regular graphs. Discrete Mathematics 73(1-2): 127-132 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:22 CEST by the dblp team