Ton Kloks

4.3k total citations
61 papers, 1.6k citations indexed

About

Ton Kloks is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Ton Kloks has authored 61 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 11 papers in Electrical and Electronic Engineering. Recurrent topics in Ton Kloks's work include Advanced Graph Theory Research (54 papers), Complexity and Algorithms in Graphs (28 papers) and Graph Labeling and Dimension Problems (27 papers). Ton Kloks is often cited by papers focused on Advanced Graph Theory Research (54 papers), Complexity and Algorithms in Graphs (28 papers) and Graph Labeling and Dimension Problems (27 papers). Ton Kloks collaborates with scholars based in Netherlands, Germany and Taiwan. Ton Kloks's co-authors include Hans L. Bodlaender, Dieter Kratsch, Haiko Müller, Hjálmtýr Hafsteinsson, John R. Gilbert, Jan Kratochvı́l, Rolf Niedermeier, Jiřı́ Fiala, Henning Fernau and Jochen Alber and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Ton Kloks

58 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ton Kloks Netherlands	21	1.4k	526	204	182	173	61	1.6k
Fǎnicǎ Gavril Israel	17	1.2k 0.9×	575 1.1×	199 1.0×	200 1.1×	121 0.7×	35	1.5k
Jayme L. Szwarcfiter Brazil	20	1.2k 0.9×	398 0.8×	330 1.6×	328 1.8×	153 0.9×	187	1.7k
Michele Conforti Italy	19	874 0.6×	242 0.5×	178 0.9×	74 0.4×	141 0.8×	91	1.3k
Elias Dahlhaus Germany	13	618 0.4×	287 0.5×	71 0.3×	58 0.3×	157 0.9×	45	937
E. F. Schmeichel United States	17	621 0.4×	230 0.4×	274 1.3×	262 1.4×	28 0.2×	76	944
Satish Rao United States	14	607 0.4×	466 0.9×	39 0.2×	37 0.2×	122 0.7×	30	956
Fabrizio Grandoni Switzerland	19	870 0.6×	674 1.3×	53 0.3×	23 0.1×	222 1.3×	84	1.4k
Shmuel Onn Israel	18	471 0.3×	97 0.2×	140 0.7×	57 0.3×	116 0.7×	78	811
Sanjiv Kapoor United States	17	327 0.2×	269 0.5×	64 0.3×	93 0.5×	85 0.5×	68	917
Mohammad R. Salavatipour Canada	18	597 0.4×	458 0.9×	113 0.6×	18 0.1×	86 0.5×	60	1.0k

Countries citing papers authored by Ton Kloks

Since Specialization

Citations

This map shows the geographic impact of Ton Kloks's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ton Kloks with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ton Kloks more than expected).

Fields of papers citing papers by Ton Kloks

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ton Kloks. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ton Kloks. The network helps show where Ton Kloks may publish in the future.

Co-authorship network of co-authors of Ton Kloks

This figure shows the co-authorship network connecting the top 25 collaborators of Ton Kloks. A scholar is included among the top collaborators of Ton Kloks based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ton Kloks. Ton Kloks is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Faria, Luérbio, et al.. (2016). On complexities of minus domination. Discrete Optimization. 22. 6–19. 1 indexed citations

Hon, Wing-Kai, et al.. (2015). On maximum independent set of categorical product and ultimate categorical ratios of graphs. Theoretical Computer Science. 588. 81–95. 3 indexed citations

Kloks, Ton & R. Tijdeman. (2013). The combinatorics of N.G. de Bruijn. Indagationes Mathematicae. 24(4). 939–970. 1 indexed citations

Xiao, Mingyu, Ton Kloks, & Sheung-Hung Poon. (2012). New parameterized algorithms for the edge dominating set problem. Theoretical Computer Science. 511. 147–158. 16 indexed citations

Kloks, Ton, et al.. (2011). k-Cographs are Kruskalian. 2011. 1 indexed citations

Chang, Maw‐Shang, et al.. (2009). On probe permutation graphs. Discrete Applied Mathematics. 157(12). 2611–2619. 7 indexed citations

Kloks, Ton, Haiko Müller, & Kristina Vušković. (2009). Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Journal of Combinatorial Theory Series B. 99(5). 733–800. 22 indexed citations

Chang, Maw‐Shang, et al.. (2008). Partitioned probe comparability graphs. Theoretical Computer Science. 396(1-3). 212–222. 4 indexed citations

Liedloff, Mathieu, Ton Kloks, Jiping Liu, & Sheng‐Lung Peng. (2008). Efficient algorithms for Roman domination on some classes of graphs. Discrete Applied Mathematics. 156(18). 3400–3415. 30 indexed citations

10.

Kloks, Ton, et al.. (2006). Improved bottleneck domination algorithms. Discrete Applied Mathematics. 154(11). 1578–1592. 4 indexed citations

11.

Kloks, Ton, et al.. (2004). Stickiness, Edge-Thickness, and Clique-Thickness in Graphs *. Journal of information science and engineering. 20. 207–217. 1 indexed citations

12.

Alber, Jochen, Hans L. Bodlaender, Henning Fernau, Ton Kloks, & Rolf Niedermeier. (2002). Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica. 33(4). 461–493. 124 indexed citations

13.

Kloks, Ton & Richard B. Tan. (2001). Bandwidth and topological bandwidth of graphs with few P4's. Discrete Applied Mathematics. 115(1-3). 117–133. 4 indexed citations

14.

Babel, Luitpold, Ton Kloks, Jan Kratochvı́l, et al.. (2001). Efficient algorithms for graphs with few P4's. Discrete Mathematics. 235(1-3). 29–51. 16 indexed citations

15.

Bodlaender, Hans L., Ton Kloks, Richard B. Tan, & Jan Van Leeuwen. (2000). lambda-Coloring of Graphs. 395–406. 29 indexed citations

16.

Broersma, Hajo, Elias Dahlhaus, & Ton Kloks. (2000). A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Applied Mathematics. 99(1-3). 367–400. 18 indexed citations

17.

Fiala, Jiřı́, Ton Kloks, & Jan Kratochvı́l. (1999). Fixed-Parameter Complexity of lambda-Labelings. 350–363. 12 indexed citations

18.

Kloks, Ton, Dieter Kratsch, & Jeremy Spinrad. (1997). On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science. 175(2). 309–335. 40 indexed citations

19.

Bodlaender, Hans L., Teofilo F. Gonzalez, & Ton Kloks. (1995). Complexity aspects of two-dimensional data compression. Nordic journal of computing. 2(4). 462–495. 1 indexed citations

20.

Bodlaender, Hans L., Klaus Jansen, Ton Kloks, et al.. (1994). Ranking of Graphs. 292–304. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact