Hajo Broersma

H. J. Broersma

	2012
111		H. J. Broersma, Zdenek Ryjácek, Petr Vrána: How Many Conjectures Can You Stand? A Survey. Graphs and Combinatorics 28(1): 57-75 (2012)
110		Douglas Bauer, H. J. Broersma, J. van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Degree Sequences and the Existence of k-Factors. Graphs and Combinatorics 28(2): 149-166 (2012)
109		Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1): 9-19 (2012)
108		Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012)
	2011
107		Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218
106		MingChu Li, Xiaodong Chen, Hajo Broersma: Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of Graph Theory 68(4): 285-298 (2011)
	2010
105		Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167
104		Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin: The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135
103		Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74
102		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)
101		Hajo Broersma, Daniël Paulusma: Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8(3): 321-329 (2010)
	2009
100		Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully Decomposable Split Graphs. IWOCA 2009: 105-112
99		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
98		Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53
97		Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma: Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009)
96		H. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto: lambda-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics 309(18): 5596-5609 (2009)
95		Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman: Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory 29(1): 143-162 (2009)
94		Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs and Combinatorics 25(4): 427-460 (2009)
93		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
92		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009)
	2008
91		Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG 2008
90		Hajo Broersma, Daniël Paulusma: Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204
89		MingChu Li, Liming Xiong, H. J. Broersma: Connected even factors in claw-free graphs. Discrete Mathematics 308(11): 2282-2284 (2008)
88		Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics 308(24): 6064-6077 (2008)
87		Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Some families of integral graphs. Discrete Mathematics 308(24): 6383-6391 (2008)
86		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
85		Hajo Broersma, Agostino Capponi, Daniël Paulusma: A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discrete Math. 22(1): 72-91 (2008)
84		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008)
	2007
83		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340
82		Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman: Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199
81		Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Integral trees of diameter 6. Discrete Applied Mathematics 155(10): 1254-1266 (2007)
80		Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec: Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics 155(10): 1336-1343 (2007)
79		A. N. M. Salman, H. J. Broersma: Path-kipas Ramsey numbers. Discrete Applied Mathematics 155(14): 1878-1884 (2007)
78		Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155(2): 92-102 (2007)
77		Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto: Toughness and hamiltonicity in k-trees. Discrete Mathematics 307(7-8): 832-838 (2007)
76		A. N. M. Salman, Hajo Broersma: On Ramsey numbers for paths versus wheels. Discrete Mathematics 307(7-8): 975-982 (2007)
75		Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electronic Notes in Discrete Mathematics 28: 55-59 (2007)
74		Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: On components of 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 29: 289-293 (2007)
73		Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, J. van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of Graph Theory 54(1): 58-72 (2007)
72		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory 55(2): 137-152 (2007)
71		Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory 55(4): 343-358 (2007)
70		Hajo Broersma, Xueliang Li: On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007)
	2006
69		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK King's College, London 2006
68		Hajo Broersma, Agostino Capponi, Daniël Paulusma: On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295
67		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261
66		Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006)
65		Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell: Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica 26(1): 17-36 (2006)
64		A. N. M. Salman, Hajo Broersma: Path-fan Ramsey numbers. Discrete Applied Mathematics 154(9): 1429-1436 (2006)
63		Liming Xiong, Hajo Broersma: Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics 154(9): 1453-1463 (2006)
62		Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006)
	2005
61		Hajo Broersma, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK King's College, London 2005
60		Liming Xiong, Zdenek Ryjácek, Hajo Broersma: On stability of the hamiltonian index under contractions and closures. Journal of Graph Theory 49(2): 104-115 (2005)
	2004
59		A. N. M. Salman, Hajo Broersma: The Ramsey Numbers of Paths Versus Kipases. CTW 2004: 218-222
58		Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214
57		Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger: The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200
56		Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink: Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discrete Applied Mathematics 136(2-3): 159-160 (2004)
55		Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li: The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics 285(1-3): 279-288 (2004)
54		A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Kipases. Electronic Notes in Discrete Mathematics 17: 251-255 (2004)
53		Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization 15(1): 1-16 (2004)
	2003
52		Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters: Mapping Applications to a Coarse Grain Reconfigurable System. Asia-Pacific Computer Systems Architecture Conference 2003: 221-235
51		Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma: An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184
50		Hajo Broersma: A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. IJCCGGT 2003: 65-79
49		Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: Template Generation and Selection Algorithms. IWSOC 2003: 2-6
48		Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: A graph covering algorithm for a coarse grain reconfigurable system. LCTES 2003: 199-208
47		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
46		A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Fans. Electronic Notes in Discrete Mathematics 13: 103-107 (2003)
45		Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)
44		A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro: Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. Journal of Automata, Languages and Combinatorics 8(4): 675-681 (2003)
	2002
43		Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
42		Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169
41		Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
40		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)
39		Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
38		Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics 120(1-3): 13-23 (2002)
37		Hajo Broersma, Liming Xiong: A note on minimum degree conditions for supereulerian graphs. Discrete Applied Mathematics 120(1-3): 35-43 (2002)
36		Hajo Broersma, Xueliang Li: Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics 120(1-3): 45-53 (2002)
35		Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li: Degree sums and subpancyclicity in line graphs. Discrete Mathematics 242(1-3): 255-267 (2002)
34		Hajo Broersma: On some intriguing problems in hamiltonian graph theory--a survey. Discrete Mathematics 251(1-3): 47-69 (2002)
33		Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics 11: 63-80 (2002)
32		Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang: A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs and Combinatorics 18(1): 193-200 (2002)
	2001
31		Hajo Broersma, Zdenek Ryjácek: Strengthening the closure concept in claw-free graphs. Discrete Mathematics 233(1-3): 55-63 (2001)
30		Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001)
29		Xueliang Li, Shenggui Zhang, Hajo Broersma: Paths and Cycles in Colored Graphs. Electronic Notes in Discrete Mathematics 8: 128-132 (2001)
	2000
28		Douglas Bauer, Hajo Broersma, Henk Jan Veldman: Not Every 2-tough Graph Is Hamiltonian. Discrete Applied Mathematics 99(1-3): 317-321 (2000)
27		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)
26		Shenggui Zhang, Xueliang Li, Hajo Broersma: Heavy paths and cycles in weighted graphs. Discrete Mathematics 223(1-3): 327-336 (2000)
25		Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Closure Concepts: A Survey. Graphs and Combinatorics 16(1): 17-48 (2000)
24		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
23		Hajo Broersma, Cornelis Hoede: Another equivalent of the graceful tree conjecture. Ars Comb. 51: (1999)
22		Hajo Broersma, Erik Engbers, Huib Trommel: Various results on the toughness of graphs. Networks 33(3): 233-238 (1999)
21		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
20		Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
19		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
18		Hajo Broersma, Huib Trommel: Closure concepts for claw-free graphs. Discrete Mathematics 185(1-3): 231-238 (1998)
	1997
17		Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
16		Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117
15		H. J. Broersma: A note on the minimum size of a vertex pancyclic graph. Discrete Mathematics 164(1-3): 29-32 (1997)
14		H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Dirac's minimum degree condition restricted to claws. Discrete Mathematics 167-168: 155-166 (1997)
13		Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz: Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics 170(1-3): 219-222 (1997)
12		Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman: Cycles through subsets with large degree sums. Discrete Mathematics 171(1-3): 43-54 (1997)
	1996
11		Hajo Broersma, Xueliang Li: The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43: (1996)
	1995
10		Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics 141(1-3): 1-10 (1995)
	1994
9		Hajo Broersma, Ingo Schiermeyer: Subgraphs, Closures and Hamiltonicity. Discrete Applied Mathematics 51(1-2): 39-46 (1994)
8		H. J. Broersma, Ingo Schiermeyer: A closure concept based on neighborhood unions of independent triples. Discrete Mathematics 124(1-3): 37-47 (1994)
	1993
7		Hajo Broersma, Xueliang Li: On "The Matching Polynomial of a Polygraph". Discrete Applied Mathematics 46(1): 79-86 (1993)
6		H. J. Broersma, F. Göbel: Coloring a graph optimally with two colors. Discrete Mathematics 118(1-3): 23-31 (1993)
5		H. J. Broersma: A note on K4-closures in hamiltonian graph theory. Discrete Mathematics 121(1-3): 19-23 (1993)
4		H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: Long cycles, degree sums and neighborhood unions. Discrete Mathematics 121(1-3): 25-35 (1993)
3		H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics 122(1-3): 37-49 (1993)
2		H. J. Broersma, J. van den Heuvel, H. A. Jung, Henk Jan Veldman: Long paths and cycles in tough graphs. Graphs and Combinatorics 9(1): 3-17 (1993)
	1989
1		Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47(2): 237-243 (1989)

Coauthor Index

1	Edy Tri Baskoro	[44] [51]
2	Douglas Bauer	[1] [10] [28] [33] [38] [62] [71] [80] [110]
3	Hans L. Bodlaender	[43] [53]
4	Thomas Böhme	[13]
5	Paul Bonsma (Paul S. Bonsma)	[104]
6	Oleg V. Borodin	[73]
7	Stephan Brandt	[65]
8	Agostino Capponi	[68] [85]
9	Xiaodong Chen	[106]
10	Elias Dahlhaus	[16] [27]
11	Stefan S. Dantchev	[69] [86] [93] [102]
12	Reinhard Diestel	[65]
13	Erik Engbers	[22]
14	Thomas Erlebach	[91]
15	Ulrich Faigle	[30] [45] [56]
16	Gasper Fijavz	[75] [88]
17	Fedor V. Fomin	[39] [41] [42] [43] [47] [53] [58] [66] [72] [78] [98] [99]
18	Tom Friedetzky	[91]
19	Jun Fujisawa	[96]
20	Alexei N. Glebov	[73]
21	F. Göbel	[6] [13]
22	Petr A. Golovach	[47] [72] [99] [103] [105] [107] [108] [109]
23	Yuanqing Guo	[48] [49] [52]
24	J. van den Heuvel	[2] [3] [4] [10] [73] [110]
25	Paul M. Heysters	[48] [49] [52]
26	Cornelis Hoede	[23] [35] [81] [87]
27	Pim van 't Hof	[98]
28	Andreas Huck	[20] [24]
29	Johann Hurink (Johann L. Hurink)	[30] [45] [56]
30	Matthew Johnson	[61] [67] [69] [83] [84] [86] [92] [93] [102]
31	H. A. Jung	[2]
32	Nathan Kahl	[80] [110]
33	Tomás Kaiser	[75] [88]
34	Ton Kloks (Antonius J. J. Kloks)	[16] [17] [19] [20] [21] [24] [27] [40]
35	Otto R. Koppius	[20] [24]
36	Alexandr V. Kostochka	[13]
37	Rastislav Kralovic (Rastislav Královic)	[78]
38	Jan Kratochvíl	[42] [66]
39	Dieter Kratsch	[17] [19] [20] [21] [24] [40] [100]
40	Matthias Kriesell	[65]
41	Roman Kuzel	[75] [88]
42	Hao Li	[12]
43	Jianping Li	[12]
44	MingChu Li	[55] [89] [106]
45	Xueliang Li	[7] [11] [26] [29] [32] [35] [36] [55] [70] [81] [87] [97]
46	Bert Marchal	[82] [95]
47	L. Marchal	[96]
48	Aurora Morgana	[38] [71] [80]
49	Haiko Müller	[17] [19] [20] [21] [24] [40]
50	Jaroslav Nesetril (Jarik Nesetril)	[39] [41]
51	Viresh Patel	[104] [107]
52	Daniël Paulusma	[57] [67] [68] [74] [82] [83] [84] [85] [90] [91] [92] [94] [95] [96] [98] [99] [101] [103] [105] [108] [109]
53	Stefan Pickl (Stefan Wolfgang Pickl)	[30] [45] [56]
54	Artem V. Pyatkin	[43] [53] [104]
55	Li Rao	[1]
56	Michèl A. J. Rosien	[52]
57	Zdenek Ryjácek	[14] [25] [31] [60] [75] [88] [111]
58	A. N. M. Salman	[44] [46] [54] [59] [64] [76] [79] [82] [95] [96]
59	Ingo Schiermeyer	[8] [9] [14] [25]
60	Edward F. Schmeichel	[33] [38] [62] [71] [80] [110]
61	Gerard J. M. Smit	[48] [49] [52] [57]
62	Jian Song	[103] [105] [108] [109]
63	Iain A. Stewart	[67] [84]
64	Michael Stiebitz	[13]
65	Georg Still (Georg J. Still)	[81] [87]
66	Surahmat	[51]
67	T. Surowiec	[80]
68	Stefan Szeider	[61] [69] [86] [93] [102]
69	Feng Tian	[12]
70	Huib Trommel	[18] [22]
71	Hilde Tuinstra	[20] [24]
72	Saladin Uttunggadewa	[51]
73	Henk Jan Veldman	[1] [2] [3] [4] [10] [12] [28]
74	Frank Vlaardingerbroek	[57]
75	Petr Vrána	[75] [88] [111]
76	Ligong Wang	[32] [81] [87]
77	Gerhard J. Woeginger	[39] [41] [42] [43] [45] [47] [53] [57] [58] [66] [72] [78] [100]
78	Liming Xiong	[35] [37] [55] [60] [63] [77] [89]
79	Xiangmei Yao	[97]
80	Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto)	[74] [77] [94] [96]
81	Shenggui Zhang	[26] [29] [32]
82	Wenli Zhou	[97]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page