×
Compute Distance To:
Author ID: kloks.ton Recent zbMATH articles by "Kloks, Ton"
Published as: Kloks, Ton; Kloks, T.
Documents Indexed: 107 Publications since 1986, including 2 Books
Co-Authors: 56 Co-Authors with 99 Joint Publications
2,136 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

85 Publications have been cited 1,348 times in 975 Documents Cited by Year
Treewidth. Computations and approximations. Zbl 0825.68144
Kloks, Ton
227
1994
Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Zbl 0861.68036
Bodlaender, Hans L.; Kloks, Ton
90
1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Zbl 0818.68118
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
73
1995
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Zbl 1016.68055
Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R.
67
2002
Rankings of graphs. Zbl 0907.68137
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt
56
1998
Fixed-parameter complexity of \(\lambda\)-labelings. Zbl 0982.05085
Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan
52
2001
Treewidth and pathwidth of permutation graphs. Zbl 0840.05087
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter
46
1995
Approximations for \(\lambda\)-colorings of graphs. Zbl 1039.68090
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
41
2004
\(\lambda\)-coloring of graphs. Zbl 0982.05050
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
38
2000
Independent sets in asteroidal triple-free graphs. Zbl 0918.68072
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
31
1999
Finding and counting small induced subgraphs efficiently. Zbl 1339.05394
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
31
2000
Listing all minimal separators of a graph. Zbl 0907.68136
Kloks, T.; Kratsch, D.
27
1998
On vertex ranking for permutation and other graphs. Zbl 0941.05516
Deogun, J. S.; Kloks, T.; Kratsch, D.; Müller, H.
27
1994
On treewidth and minimum fill-in of asteroidal triple-free graphs. Zbl 0903.68139
Kloks, Ton; Kratsch, Dieter; Spinrad, Jeremy
24
1997
New algorithms for \(k\)-face cover, \(k\)-feedback vertex set, and \(k\)-disjoint cycles on plane and planar graphs. Zbl 1022.68100
Kloks, Ton; Lee, C. M.; Liu, Jiping
24
2002
Approximating the bandwidth for asteroidal triple-free graphs. Zbl 0951.68113
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
24
1999
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Zbl 1218.05160
Kloks, Ton; Müller, Haiko; Vušković, Kristina
22
2009
Treewidth and minimum fill-in on \(d\)-trapezoid graphs. Zbl 0905.68101
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
21
1998
Efficient algorithms for Roman domination on some classes of graphs. Zbl 1180.05113
Liedloff, Mathieu; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
21
2008
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Zbl 0940.05064
Broersma, H. J.; Dahlhaus, E.; Kloks, T.
17
2000
Bandwidth of chain graphs. Zbl 1339.05393
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
17
1998
Better algorithms for the pathwidth and treewidth of graphs. Zbl 0764.68108
Bodlaender, Hans L.; Kloks, Ton
16
1991
On the vertex ranking problem for trapezoid, circular-arc and other graphs. Zbl 0937.68093
Deogun, Jitender S.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
16
1999
Fixed-parameter complexity of \(\lambda\)-labelings. Zbl 0943.05072
Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan
15
1999
Minimum fill-in on circle and circular-arc graphs. Zbl 0912.68156
Kloks, T.; Kratsch, D.; Wong, C. K.
14
1998
Time-varying shortest path problems with constraints. Zbl 0876.05060
Cai, X.; Kloks, T.; Wong, C. K.
14
1997
Measuring the vulnerability for classes of intersection graphs. Zbl 0881.05118
Kratsch, Dieter; Kloks, Ton; Müller, Haiko
14
1997
Treewidth of chordal bipartite graphs. Zbl 0839.68070
Kloks, T.; Kratsch, D.
14
1995
Efficient algorithms for graphs with few \(P_4\)’s. Zbl 0980.05045
Babel, Luitpold; Kloks, Ton; Kratochvil, Jan; Kratsch, Dieter; Müller, Haiko; Olariu, Stephan
14
2001
On the recognition of general partition graphs. Zbl 1255.05160
Kloks, Ton; Lee, Chuan-Min; Liu, Jiping; Müller, Haiko
13
2003
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Zbl 0875.68458
Kloks, T.; Kratsch, D.
11
1995
New parameterized algorithms for the edge dominating set problem. Zbl 1407.68231
Xiao, Mingyu; Kloks, Ton; Poon, Sheung-Hung
11
2013
Approximating treewidth, pathwidth, and minimum elimination tree height. Zbl 0768.68121
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
11
1992
Approximating tree width and pathwidth of some classes of perfect graphs. Zbl 0925.05052
Kloks, Ton; Bodlaender, Hans
10
1992
Treewidth of circle graphs. Zbl 0852.68069
Kloks, T.
10
1996
On the recognition of probe graphs of some self-complementary classes of perfect graphs. Zbl 1128.05313
Chang, Maw-Shang; Kloks, Ton; Kratsch, Dieter; Liu, Jiping; Peng, Sheng-Lung
10
2005
On the structure of graphs with bounded asteroidal number. Zbl 0989.05059
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
10
2001
Asteroidal sets in graphs. Zbl 0897.05076
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
9
1997
Vertex ranking of asteroidal triple-free graphs. Zbl 1339.05395
Kloks, Ton; Müller, Haiko; Wong, C. K.
9
1998
Maximum clique transversals. Zbl 1042.68619
Chang, Maw-Shang; Kloks, Ton; Lee, Chuan-Min
8
2001
A simple linear time algorithm for triangulating three-colored graphs. Zbl 0785.68042
Bodlaender, Hans L.; Kloks, Ton
8
1993
Bandwidth of split and circular permutation graphs. Zbl 0988.68125
Kloks, Ton; Kratsch, Dieter; Le Borgne, Yvan; Müller, Haiko
7
2000
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Zbl 1009.68099
Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H.
6
2002
Kernels in planar digraphs. Zbl 1170.68547
Gutin, Gregory; Kloks, Ton; Lee, Chuan Min; Yeo, Anders
6
2005
Treewidth of circle graphs. Zbl 0925.05063
Kloks, T.
6
1993
Finding all minimal separators of a graph. Zbl 0941.05514
Kloks, T.; Kratsch, D.
6
1994
Degree-preserving trees. Zbl 0938.90065
Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
6
2000
Independent sets in asteroidal triple-free graphs. Zbl 1401.05278
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
5
1997
A class of graphs containing the polar spaces. Zbl 0606.05059
Blokhuis, A.; Kloks, T.; Wilbrink, H.
5
1986
On probe permutation graphs. Zbl 1211.05035
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
5
2009
Rainbow domination and related problems on some classes of perfect graphs. Zbl 1478.05104
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Hung-Lung
4
2016
New branchwidth territories. Zbl 0924.05063
Kloks, Ton; Kratochvíl, Jan; Müller, Haiko
4
1999
Roman domination over some graph classes. Zbl 1171.05389
Liedloff, Mathieu; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2005
Computing the branchwidth of interval graphs. Zbl 1084.05068
Kloks, Ton; Kratochvíl, Jan; Müller, Haiko
4
2005
Bandwidth and topological bandwidth of graphs with few \(P_4\)’s. Zbl 0989.05104
Kloks, Ton; Tan, Richard B.
4
2001
Treewidth of chordal bipartite graphs. Zbl 0799.68113
Kloks, T.; Kratsch, D.
4
1993
Block-graph width. Zbl 1221.05274
Chang, Maw-Shang; Hung, Ling-Ju; Kloks, Ton; Peng, Sheng-Lung
4
2011
Recognition of probe cographs and partitioned probe distance hereditary graphs. Zbl 1137.68471
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2006
Partitioned probe comparability graphs. Zbl 1145.68037
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2008
On perfect absorbants in de Bruijn digraphs. Zbl 1303.05076
Wang, Yue-Li; Wu, Kuo-Hua; Kloks, Ton
3
2013
SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s. Zbl 1038.90545
Bodlaender, Hans L.; Kloks, Ton; Niedermeier, Rolf
3
1999
Probe matrix problems: Totally balanced matrices. Zbl 1137.68472
Chandler, David B.; Guo, Jiong; Kloks, Ton; Niedermeier, Rolf
3
2007
An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs. Zbl 0800.05012
Kloks, T.
2
1989
On complexities of minus domination. Zbl 1387.90264
Faria, Luérbio; Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Tao-Ming; Wang, Yue-Li
2
2016
A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking. Zbl 0928.68086
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
2
1998
On the equivalence covering number of splitgraphs. Zbl 0875.68456
Blokhuis, A.; Kloks, T.
2
1995
\(K_{1,3}\)-free and \(W_4\)-free graphs. Zbl 0900.68231
Kloks, T.
2
1997
Algorithms for the treewidth and minimum fill-in of HHD-free graphs. Zbl 0890.68091
Broersma, H. J.; Dahlhaus, E.; Kloks, T.
2
1997
Minimum fill-in on circle and circular-arc graphs. Zbl 1046.68631
Kloks, T.; Kratsch, D.; Wong, C. K.
2
1996
On retracts, absolute retracts, and folds in cographs. Zbl 1417.05174
Kloks, Ton; Wang, Yue-Li
2
2013
New parameterized algorithms for the edge dominating set problem. Zbl 1343.68125
Xiao, Mingyu; Kloks, Ton; Poon, Sheung-Hung
2
2011
On the structure of graphs with bounded asteroidal number. Zbl 1039.05534
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
2
1999
Treewidth and pathwidth of permutation graphs. Zbl 1418.68162
Bodlaender, Hans; Kloks, Ton; Kratsch, Dieter
2
1993
On maximum independent set of categorical product and ultimate categorical ratios of graphs. Zbl 1326.05106
Hon, Wing-Kai; Kloks, Ton; Liu, Ching-Hao; Liu, Hsiang-Hsuan; Poon, Sheung-Hung; Wang, Yue-Li
2
2015
\(k\)-cographs are Kruskalian. Zbl 1286.05143
Hung, Ling-Ju; Kloks, Ton
2
2011
Probe interval bigraphs. Zbl 1203.05148
Chang, Gerard Jennhwa; Kloks, Ton; Peng, Sheng-Lung
2
2005
On efficient absorbant conjecture in generalized de Bruijn digraphs. Zbl 1376.05117
Wu, Kuo-Hua; Wang, Yue-Li; Kloks, Ton
2
2017
Gray codes for AT-free orders via antimatroids. Zbl 1474.68212
Chang, Jou-Ming; Kloks, Ton; Wang, Hung-Lung
1
2016
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs. Zbl 1320.05125
Kloks, Ton; Poon, Sheung-Hung; Ung, Chin-Ting; Wang, Yue-Li
1
2015
On the Grundy number of Cameron graphs. Zbl 1383.05100
Hon, Wing-Kai; Kloks, Ton; Liu, Fu-Hong; Liu, Hsiang-Hsuan; Wang, Tao-Ming
1
2017
Improved bottleneck domination algorithms. Zbl 1104.68129
Kloks, Ton; Kratsch, Dieter; Lee, Chuan-Min; Liu, Jiping
1
2006
Probe Ptolemaic graphs. Zbl 1148.05309
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Le, Van Bang; Peng, Sheng-Lung
1
2008
Edge-clique covers of the tensor product. Zbl 1445.05087
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Yue-Li
1
2014
The combinatorics of N. G. de Bruijn. Zbl 1300.05002
Kloks, Ton; Tijdeman, Rob
1
2013
On independence domination. Zbl 1390.68348
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Poon, Sheung-Hung; Wang, Yue-Li
1
2013
On efficient absorbant conjecture in generalized de Bruijn digraphs. Zbl 1376.05117
Wu, Kuo-Hua; Wang, Yue-Li; Kloks, Ton
2
2017
On the Grundy number of Cameron graphs. Zbl 1383.05100
Hon, Wing-Kai; Kloks, Ton; Liu, Fu-Hong; Liu, Hsiang-Hsuan; Wang, Tao-Ming
1
2017
Rainbow domination and related problems on some classes of perfect graphs. Zbl 1478.05104
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Hung-Lung
4
2016
On complexities of minus domination. Zbl 1387.90264
Faria, Luérbio; Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Tao-Ming; Wang, Yue-Li
2
2016
Gray codes for AT-free orders via antimatroids. Zbl 1474.68212
Chang, Jou-Ming; Kloks, Ton; Wang, Hung-Lung
1
2016
On maximum independent set of categorical product and ultimate categorical ratios of graphs. Zbl 1326.05106
Hon, Wing-Kai; Kloks, Ton; Liu, Ching-Hao; Liu, Hsiang-Hsuan; Poon, Sheung-Hung; Wang, Yue-Li
2
2015
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs. Zbl 1320.05125
Kloks, Ton; Poon, Sheung-Hung; Ung, Chin-Ting; Wang, Yue-Li
1
2015
Edge-clique covers of the tensor product. Zbl 1445.05087
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Yue-Li
1
2014
New parameterized algorithms for the edge dominating set problem. Zbl 1407.68231
Xiao, Mingyu; Kloks, Ton; Poon, Sheung-Hung
11
2013
On perfect absorbants in de Bruijn digraphs. Zbl 1303.05076
Wang, Yue-Li; Wu, Kuo-Hua; Kloks, Ton
3
2013
On retracts, absolute retracts, and folds in cographs. Zbl 1417.05174
Kloks, Ton; Wang, Yue-Li
2
2013
The combinatorics of N. G. de Bruijn. Zbl 1300.05002
Kloks, Ton; Tijdeman, Rob
1
2013
On independence domination. Zbl 1390.68348
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Poon, Sheung-Hung; Wang, Yue-Li
1
2013
Block-graph width. Zbl 1221.05274
Chang, Maw-Shang; Hung, Ling-Ju; Kloks, Ton; Peng, Sheng-Lung
4
2011
New parameterized algorithms for the edge dominating set problem. Zbl 1343.68125
Xiao, Mingyu; Kloks, Ton; Poon, Sheung-Hung
2
2011
\(k\)-cographs are Kruskalian. Zbl 1286.05143
Hung, Ling-Ju; Kloks, Ton
2
2011
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Zbl 1218.05160
Kloks, Ton; Müller, Haiko; Vušković, Kristina
22
2009
On probe permutation graphs. Zbl 1211.05035
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
5
2009
Efficient algorithms for Roman domination on some classes of graphs. Zbl 1180.05113
Liedloff, Mathieu; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
21
2008
Partitioned probe comparability graphs. Zbl 1145.68037
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2008
Probe Ptolemaic graphs. Zbl 1148.05309
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Le, Van Bang; Peng, Sheng-Lung
1
2008
Probe matrix problems: Totally balanced matrices. Zbl 1137.68472
Chandler, David B.; Guo, Jiong; Kloks, Ton; Niedermeier, Rolf
3
2007
Recognition of probe cographs and partitioned probe distance hereditary graphs. Zbl 1137.68471
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2006
Improved bottleneck domination algorithms. Zbl 1104.68129
Kloks, Ton; Kratsch, Dieter; Lee, Chuan-Min; Liu, Jiping
1
2006
On the recognition of probe graphs of some self-complementary classes of perfect graphs. Zbl 1128.05313
Chang, Maw-Shang; Kloks, Ton; Kratsch, Dieter; Liu, Jiping; Peng, Sheng-Lung
10
2005
Kernels in planar digraphs. Zbl 1170.68547
Gutin, Gregory; Kloks, Ton; Lee, Chuan Min; Yeo, Anders
6
2005
Roman domination over some graph classes. Zbl 1171.05389
Liedloff, Mathieu; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung
4
2005
Computing the branchwidth of interval graphs. Zbl 1084.05068
Kloks, Ton; Kratochvíl, Jan; Müller, Haiko
4
2005
Probe interval bigraphs. Zbl 1203.05148
Chang, Gerard Jennhwa; Kloks, Ton; Peng, Sheng-Lung
2
2005
Approximations for \(\lambda\)-colorings of graphs. Zbl 1039.68090
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
41
2004
On the recognition of general partition graphs. Zbl 1255.05160
Kloks, Ton; Lee, Chuan-Min; Liu, Jiping; Müller, Haiko
13
2003
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Zbl 1016.68055
Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R.
67
2002
New algorithms for \(k\)-face cover, \(k\)-feedback vertex set, and \(k\)-disjoint cycles on plane and planar graphs. Zbl 1022.68100
Kloks, Ton; Lee, C. M.; Liu, Jiping
24
2002
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Zbl 1009.68099
Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H.
6
2002
Fixed-parameter complexity of \(\lambda\)-labelings. Zbl 0982.05085
Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan
52
2001
Efficient algorithms for graphs with few \(P_4\)’s. Zbl 0980.05045
Babel, Luitpold; Kloks, Ton; Kratochvil, Jan; Kratsch, Dieter; Müller, Haiko; Olariu, Stephan
14
2001
On the structure of graphs with bounded asteroidal number. Zbl 0989.05059
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
10
2001
Maximum clique transversals. Zbl 1042.68619
Chang, Maw-Shang; Kloks, Ton; Lee, Chuan-Min
8
2001
Bandwidth and topological bandwidth of graphs with few \(P_4\)’s. Zbl 0989.05104
Kloks, Ton; Tan, Richard B.
4
2001
\(\lambda\)-coloring of graphs. Zbl 0982.05050
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
38
2000
Finding and counting small induced subgraphs efficiently. Zbl 1339.05394
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
31
2000
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Zbl 0940.05064
Broersma, H. J.; Dahlhaus, E.; Kloks, T.
17
2000
Bandwidth of split and circular permutation graphs. Zbl 0988.68125
Kloks, Ton; Kratsch, Dieter; Le Borgne, Yvan; Müller, Haiko
7
2000
Degree-preserving trees. Zbl 0938.90065
Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
6
2000
Independent sets in asteroidal triple-free graphs. Zbl 0918.68072
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
31
1999
Approximating the bandwidth for asteroidal triple-free graphs. Zbl 0951.68113
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
24
1999
On the vertex ranking problem for trapezoid, circular-arc and other graphs. Zbl 0937.68093
Deogun, Jitender S.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
16
1999
Fixed-parameter complexity of \(\lambda\)-labelings. Zbl 0943.05072
Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan
15
1999
New branchwidth territories. Zbl 0924.05063
Kloks, Ton; Kratochvíl, Jan; Müller, Haiko
4
1999
SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s. Zbl 1038.90545
Bodlaender, Hans L.; Kloks, Ton; Niedermeier, Rolf
3
1999
On the structure of graphs with bounded asteroidal number. Zbl 1039.05534
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
2
1999
Rankings of graphs. Zbl 0907.68137
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt
56
1998
Listing all minimal separators of a graph. Zbl 0907.68136
Kloks, T.; Kratsch, D.
27
1998
Treewidth and minimum fill-in on \(d\)-trapezoid graphs. Zbl 0905.68101
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
21
1998
Bandwidth of chain graphs. Zbl 1339.05393
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
17
1998
Minimum fill-in on circle and circular-arc graphs. Zbl 0912.68156
Kloks, T.; Kratsch, D.; Wong, C. K.
14
1998
Vertex ranking of asteroidal triple-free graphs. Zbl 1339.05395
Kloks, Ton; Müller, Haiko; Wong, C. K.
9
1998
A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking. Zbl 0928.68086
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
2
1998
On treewidth and minimum fill-in of asteroidal triple-free graphs. Zbl 0903.68139
Kloks, Ton; Kratsch, Dieter; Spinrad, Jeremy
24
1997
Time-varying shortest path problems with constraints. Zbl 0876.05060
Cai, X.; Kloks, T.; Wong, C. K.
14
1997
Measuring the vulnerability for classes of intersection graphs. Zbl 0881.05118
Kratsch, Dieter; Kloks, Ton; Müller, Haiko
14
1997
Asteroidal sets in graphs. Zbl 0897.05076
Kloks, Ton; Kratsch, Dieter; Müller, Haiko
9
1997
Independent sets in asteroidal triple-free graphs. Zbl 1401.05278
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
5
1997
\(K_{1,3}\)-free and \(W_4\)-free graphs. Zbl 0900.68231
Kloks, T.
2
1997
Algorithms for the treewidth and minimum fill-in of HHD-free graphs. Zbl 0890.68091
Broersma, H. J.; Dahlhaus, E.; Kloks, T.
2
1997
Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Zbl 0861.68036
Bodlaender, Hans L.; Kloks, Ton
90
1996
Treewidth of circle graphs. Zbl 0852.68069
Kloks, T.
10
1996
Minimum fill-in on circle and circular-arc graphs. Zbl 1046.68631
Kloks, T.; Kratsch, D.; Wong, C. K.
2
1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Zbl 0818.68118
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
73
1995
Treewidth and pathwidth of permutation graphs. Zbl 0840.05087
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter
46
1995
Treewidth of chordal bipartite graphs. Zbl 0839.68070
Kloks, T.; Kratsch, D.
14
1995
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Zbl 0875.68458
Kloks, T.; Kratsch, D.
11
1995
On the equivalence covering number of splitgraphs. Zbl 0875.68456
Blokhuis, A.; Kloks, T.
2
1995
Treewidth. Computations and approximations. Zbl 0825.68144
Kloks, Ton
227
1994
On vertex ranking for permutation and other graphs. Zbl 0941.05516
Deogun, J. S.; Kloks, T.; Kratsch, D.; Müller, H.
27
1994
Finding all minimal separators of a graph. Zbl 0941.05514
Kloks, T.; Kratsch, D.
6
1994
A simple linear time algorithm for triangulating three-colored graphs. Zbl 0785.68042
Bodlaender, Hans L.; Kloks, Ton
8
1993
Treewidth of circle graphs. Zbl 0925.05063
Kloks, T.
6
1993
Treewidth of chordal bipartite graphs. Zbl 0799.68113
Kloks, T.; Kratsch, D.
4
1993
Treewidth and pathwidth of permutation graphs. Zbl 1418.68162
Bodlaender, Hans; Kloks, Ton; Kratsch, Dieter
2
1993
Approximating treewidth, pathwidth, and minimum elimination tree height. Zbl 0768.68121
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
11
1992
Approximating tree width and pathwidth of some classes of perfect graphs. Zbl 0925.05052
Kloks, Ton; Bodlaender, Hans
10
1992
Better algorithms for the pathwidth and treewidth of graphs. Zbl 0764.68108
Bodlaender, Hans L.; Kloks, Ton
16
1991
An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs. Zbl 0800.05012
Kloks, T.
2
1989
A class of graphs containing the polar spaces. Zbl 0606.05059
Blokhuis, A.; Kloks, T.; Wilbrink, H.
5
1986
all top 5

Cited by 1,322 Authors

36 Fomin, Fedor V.
35 Thilikos, Dimitrios M.
33 Bodlaender, Hans L.
25 Kratsch, Dieter
23 Paulusma, Daniël
20 Golovach, Petr A.
20 Kloks, Ton
19 Heggernes, Pinar
18 Lokshtanov, Daniel
17 Saurabh, Saket
16 Niedermeier, Rolf
16 Sau, Ignasi
16 Todinca, Ioan
15 Milanič, Martin
14 Müller, Haiko
14 Ono, Hirotaka
12 Fiala, Jiří
12 Szeider, Stefan
11 Ganian, Robert
11 Kratochvíl, Jan
11 Liedloff, Mathieu
11 Villanger, Yngve
10 Fellows, Michael Ralph
10 Hanaka, Tesshu
10 Paul, Christophe
9 Lampis, Michael
9 Ordyniak, Sebastian
9 Ossona de Mendez, Patrice
9 Otachi, Yota
9 Peng, Sheng-Lung
9 Sampaio, Rudini Menezes
9 Telle, Jan Arne
8 Belmonte, Rémy
8 Dereniowski, Dariusz
8 Dorn, Frederic
8 Kanj, Iyad A.
8 Narayan, Darren A.
8 Nešetřil, Jaroslav
8 Pilipczuk, Michał
7 Brandstädt, Andreas
7 Chandran, L. Sunil
7 de Figueiredo, Celina M. Herrera
7 Kammer, Frank
7 Kobayashi, Yasuaki
7 Lingas, Andrzej
7 Meister, Daniel
7 Pal, Madhumangal
7 Philip, Geevarghese
7 Rzążewski, Paweł
7 Uno, Yushi
7 van ’t Hof, Pim
7 Woltran, Stefan
6 Baste, Julien
6 Berry, Anne
6 Cerioli, Márcia R.
6 Chang, Maw-Shang
6 Chen, Jian-er
6 Dragan, Feodor F.
6 Eiben, Eduard
6 Giannopoulou, Archontia C.
6 Guo, Jiong
6 Junosza-Szaniawski, Konstanty
6 Kowaluk, Mirosław
6 Kwon, Ojoung
6 Lozin, Vadim Vladislavovich
6 Nisse, Nicolas
6 Papadopoulos, Charis
6 Rossmanith, Peter
6 Shao, Zhendong
6 Tuza, Zsolt
6 Wang, Yue-Li
5 Bouchitté, Vincent
5 Broersma, Hajo J.
5 Calamoneri, Tiziana
5 Gutin, Gregory Z.
5 Katsikarelis, Ioannis
5 Knop, Dušan
5 Král’, Daniel
5 Lê Văn Băng
5 Lee, Chuan-Min
5 Lin, Wensong
5 Linhares-Sales, Claudia
5 Naserasr, Reza
5 Nishimura, Naomi
5 Orlovich, Yury L.
5 Paschos, Vangelis Th.
5 Pilipczuk, Marcin L.
5 Raman, Venkatesh
5 Raymond, Jean-Florent
5 Tamaki, Hisao
5 Xia, Ge
5 Yamazaki, Koichi
5 Yeh, Roger K.-C.
4 Alcón, Liliana
4 Betzler, Nadja
4 Bykova, Valentina Vladimirovna
4 Cameron, Kathie
4 Campos, Victor A.
4 Chang, Gerard Jennhwa
4 Chaplick, Steven
...and 1,222 more Authors
all top 5

Cited in 117 Serials

182 Discrete Applied Mathematics
108 Theoretical Computer Science
74 Algorithmica
56 Discrete Mathematics
43 Information Processing Letters
32 Journal of Computer and System Sciences
25 Journal of Combinatorial Optimization
18 Theory of Computing Systems
18 Journal of Discrete Algorithms
17 European Journal of Combinatorics
16 SIAM Journal on Discrete Mathematics
13 Information and Computation
11 Artificial Intelligence
10 International Journal of Foundations of Computer Science
9 Graphs and Combinatorics
9 Discrete Optimization
8 Discrete Mathematics, Algorithms and Applications
7 Journal of Graph Theory
6 Networks
6 SIAM Journal on Computing
6 European Journal of Operational Research
6 The Electronic Journal of Combinatorics
6 Discussiones Mathematicae. Graph Theory
6 Journal of Graph Algorithms and Applications
5 Journal of Combinatorial Theory. Series B
5 Annals of Operations Research
5 Mathematical Programming. Series A. Series B
5 AKCE International Journal of Graphs and Combinatorics
4 Information Sciences
4 Computers & Operations Research
4 Applied Mathematics Letters
4 International Journal of Computer Mathematics
4 Trudy Instituta Matematiki
4 Algorithms
4 Computer Science Review
4 Prikladnaya Diskretnaya Matematika
3 Applied Mathematics and Computation
3 Operations Research Letters
3 Journal of Applied Mathematics and Computing
3 Logical Methods in Computer Science
2 Acta Informatica
2 Combinatorica
2 Order
2 Random Structures & Algorithms
2 Discrete Mathematics and Applications
2 Distributed Computing
2 Journal of Mathematical Sciences (New York)
2 Annals of Mathematics and Artificial Intelligence
2 Theory and Practice of Logic Programming
2 Internet Mathematics
2 Mathematics in Computer Science
2 Optimization Letters
1 Advances in Applied Probability
1 Communications in Mathematical Physics
1 Bulletin of Mathematical Biology
1 ACM Transactions on Mathematical Software
1 BIT
1 Computing
1 Geometriae Dedicata
1 Journal of Combinatorial Theory. Series A
1 Kybernetika
1 Naval Research Logistics
1 Operations Research
1 Bulletin of the Korean Mathematical Society
1 Acta Mathematica Hungarica
1 Acta Mathematicae Applicatae Sinica. English Series
1 Journal of Computer Science and Technology
1 Journal of Automated Reasoning
1 International Journal of Approximate Reasoning
1 Mathematical and Computer Modelling
1 International Journal of Computational Geometry & Applications
1 International Journal of Algebra and Computation
1 Computational Statistics
1 Aequationes Mathematicae
1 Automation and Remote Control
1 Linear Algebra and its Applications
1 Computational Statistics and Data Analysis
1 Journal of Computer and Systems Sciences International
1 Applied Mathematics. Series B (English Edition)
1 Combinatorics, Probability and Computing
1 The Journal of Artificial Intelligence Research (JAIR)
1 Constraints
1 Mathematical Problems in Engineering
1 Soft Computing
1 Mathematical Methods of Operations Research
1 Journal of Scheduling
1 Journal of the ACM
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Discrete Dynamics in Nature and Society
1 Journal of the European Mathematical Society (JEMS)
1 Acta Mathematica Sinica. English Series
1 CEJOR. Central European Journal of Operations Research
1 Fundamenta Informaticae
1 RAIRO. Operations Research
1 Journal of Machine Learning Research (JMLR)
1 Quantum Information Processing
1 ACM Journal of Experimental Algorithmics
1 Applicable Analysis and Discrete Mathematics
1 Ars Mathematica Contemporanea
...and 17 more Serials

Citations by Year