Ton Kloks

Antonius J. J. Kloks

	2009
87		Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: Block-Graph Width. TAMC 2009: 150-157
86		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)
	2008
85		David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng: Probe Ptolemaic Graphs. COCOON 2008: 468-477
84		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)
83		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)
	2007
82		David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier: Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377
	2006
81		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
80		Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee: The Maximum Interval Graphs on Distance Hereditary Graphs. JCIS 2006
79		David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng: On Probe Permutation Graphs. TAMC 2006: 494-504
78		David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Partitioned Probe Comparability Graphs. WG 2006: 179-190
77		Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu: Improved bottleneck domination algorithms. Discrete Applied Mathematics 154(11): 1578-1592 (2006)
	2005
76		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
75		Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: The PIGs Full Monty - A Floor Show of Minimal Separators. STACS 2005: 521-532
74		Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Roman Domination over Some Graph Classes. WG 2005: 103-114
73		Ton Kloks, Jan Kratochvíl, Haiko Müller: Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145(2): 266-275 (2005)
72		Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng: Probe interval bigraphs. Electronic Notes in Discrete Mathematics 19: 195-201 (2005)
71		Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005)
	2004
70		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
69		Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004)
68		Ton Kloks, Chuan-Min Lee, Jiping Liu: Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. J. Inf. Sci. Eng. 20(2): 207-217 (2004)
	2003
67		Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller: On the Recognition of General Partition Graphs. WG 2003: 273-283
	2002
66		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
65		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)
64		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)
	2001
63		Maw-Shang Chang, Ton Kloks, Chuan-Min Lee: Maximum Clique Transversals. WG 2001: 32-43
62		Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-parameter complexity of lambda-labelings. Discrete Applied Mathematics 113(1): 59-72 (2001)
61		Ton Kloks, Richard B. Tan: Bandwidth and topological bandwidth of graphs with few P4's. Discrete Applied Mathematics 115(1-3): 117-133 (2001)
60		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)
59		Ton Kloks, Dieter Kratsch, Haiko Müller: On the Structure of Graphs with Bounded Asteroidal Number. Graphs and Combinatorics 17(2): 295-306 (2001)
	2000
58		Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: lambda-Coloring of Graphs. STACS 2000: 395-406
57		Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller: Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
56		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)
55		Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000)
54		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)
	1999
53		Ton Kloks, Jan Kratochvíl, Haiko Müller: New Branchwidth Territories. STACS 1999: 173-183
52		Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363
51		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)
50		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)
49		Ton Kloks, Dieter Kratsch, Haiko Müller: On the structure of graphs with bounded asteroidal number. Electronic Notes in Discrete Mathematics 3: 94 (1999)
48		Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999)
47		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)
	1998
46		Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
45		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
44		Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998)
43		Ton Kloks, Dieter Kratsch, Haiko Müller: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998)
42		Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998)
41		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)
40		Ton Kloks, Dieter Kratsch: Listing All Minimal Separators of a Graph. SIAM J. Comput. 27(3): 605-613 (1998)
39		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)
	1997
38		Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
37		Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117
36		Ton Kloks, Dieter Kratsch, Haiko Müller: Asteroidal Sets in Graphs. WG 1997: 229-241
35		Dieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. Discrete Applied Mathematics 77(3): 259-270 (1997)
34		X. Cai, Ton Kloks, C. K. Wong: Time-varying shortest path problems with constraints. Networks 29(3): 141-150 (1997)
33		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)
	1996
32		Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267
31		Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182
30		X. Cai, Ton Kloks, C. K. Wong: Shortest Path Problems with Time Constraints. MFCS 1996: 255-266
29		Ton Kloks: K_1, 3-Free and W_4-Free Graphs. Inf. Process. Lett. 60(4): 221-223 (1996)
28		Ton Kloks: Treewidth of Circle Graphs. Int. J. Found. Comput. Sci. 7(2): 111-120 (1996)
27		Hans L. Bodlaender, Ton Kloks: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms 21(2): 358-402 (1996)
	1995
26		Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447
25		Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23
24		Aart Blokhuis, Ton Kloks: On the Equivalence Covering Number of Splitgraphs. Inf. Process. Lett. 54(5): 301-304 (1995)
23		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)
22		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)
21		Ton Kloks, Dieter Kratsch: Treewidth of Chordal Bipartite Graphs. J. Algorithms 19(2): 266-281 (1995)
20		Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)
19		Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8(4): 606-616 (1995)
	1994
18		Ton Kloks: Treewidth, Computations and Approximations Springer 1994
17		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
16		Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
15		Ton Kloks, Dieter Kratsch: Finding All Minimal Separators of a Graph. STACS 1994: 759-768
14		Ton Kloks, Dieter Kratsch, Haiko Müller: Dominoes. WG 1994: 106-120
13		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
12		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
11		Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125
10		Ton Kloks: Treewidth of Circle Graphs. ISAAC 1993: 108-117
9		Ton Kloks, Dieter Kratsch: Treewidth of Bipartite Graphs. STACS 1993: 80-89
8		Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993)
	1992
7		Ton Kloks, Hans L. Bodlaender: Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125
6		Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS 1992: 415-423
5		Ton Kloks, Hans L. Bodlaender: Testing Superperfection of k-Trees. SWAT 1992: 292-303
	1991
4		Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296
3		Hans L. Bodlaender, Ton Kloks: Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555
2		Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson: Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12
	1989
1		Ton Kloks: An infinite sequence of GammaDelta-regular graphs. Discrete Mathematics 73(1-2): 127-132 (1989)

Coauthor Index

1	Jochen Alber	[64]
2	Luitpold Babel	[60]
3	Aart Blokhuis	[24]
4	Hans L. Bodlaender	[2] [3] [4] [5] [6] [7] [8] [11] [12] [13] [17] [19] [20] [22] [27] [39] [41] [50] [58] [64] [69] [70]
5	Yvan Le Borgne	[57]
6	Hajo Broersma (H. J. Broersma)	[37] [38] [45] [46] [47] [54] [56] [65]
7	X. Cai	[30] [34]
8	David B. Chandler	[78] [79] [81] [82] [83] [85] [86]
9	Gerard Jennhwa Chang	[72] [75]
10	Maw-Shang Chang	[63] [76] [78] [79] [81] [83] [85] [86] [87]
11	Elias Dahlhaus	[37] [56]
12	Jitender S. Deogun	[13] [16] [39] [51]
13	Henning Fernau	[64]
14	Jirí Fiala	[52] [62]
15	Celina M. Herrera de Figueiredo	[70]
16	John R. Gilbert	[2] [22]
17	Teofilo F. Gonzalez	[4] [20]
18	Jiong Guo	[82]
19	Marisa Gutierrez	[70]
20	Gregory Gutin	[71]
21	Hjálmtyr Hafsteinsson	[2] [22]
22	Andreas Huck	[46] [54]
23	Ling-Ju Hung	[87]
24	Klaus Jansen	[13] [39]
25	Otto R. Koppius	[46] [54]
26	Jan Kratochvíl	[52] [53] [60] [62] [73]
27	Dieter Kratsch	[9] [11] [12] [13] [14] [15] [16] [17] [19] [21] [23] [25] [26] [32] [33] [35] [36] [38] [39] [40] [41] [42] [43] [45] [46] [47] [48] [49] [51] [54] [55] [57] [59] [60] [65] [76] [77]
28	Van Bang Le	[85]
29	Chuan-Min Lee	[63] [66] [67] [68] [71] [77] [80]
30	Jan van Leeuwen	[58] [69]
31	Mathieu Liedloff	[74] [84]
32	Jiping Liu	[66] [67] [68] [74] [75] [76] [77] [78] [79] [81] [83] [84] [86]
33	Haiko Müller	[12] [13] [14] [16] [17] [25] [26] [31] [35] [36] [38] [39] [41] [43] [44] [45] [46] [47] [48] [49] [51] [53] [54] [55] [57] [59] [60] [65] [67] [73]
34	Rolf Niedermeier	[50] [64] [70] [82]
35	Stephan Olariu	[60]
36	Sheng-Lung Peng	[72] [74] [75] [76] [78] [79] [80] [81] [83] [84] [85] [86] [87]
37	Jeremy Spinrad	[33]
38	Richard B. Tan	[58] [61] [69]
39	Hilde Tuinstra	[46] [54]
40	Zsolt Tuza	[13] [39]
41	Chak-Kuen Wong (C. K. Wong)	[30] [31] [32] [34] [42] [44]
42	Anders Yeo	[71]

Colors in the list of coauthors