dblp.uni-trier.dewww.uni-trier.de

Henning Fernau Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
149EEGábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97
148EEHenning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
147EEHenning Fernau, Daniel Raible: Packing Paths: Recycling Saves Time. CTW 2009: 79-83
146EEHenning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432
145EEHenning Fernau, Daniel Raible: Searching Trees: An Essay. TAMC 2009: 59-70
144EEGábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying CoRR abs/0906.4431: (2009)
143EELjiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR abs/0909.4224: (2009)
142EEHenning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta: Offensive r-alliances in graphs. Discrete Applied Mathematics 157(1): 177-182 (2009)
141EEJose Maria Sigarreta, Sergio Bermudo, Henning Fernau: On the complement graph and defensive k-alliances. Discrete Applied Mathematics 157(8): 1687-1695 (2009)
140EEHenning Fernau: Algorithms for learning regular expressions from positive data. Inf. Comput. 207(4): 521-541 (2009)
139EEHenning Fernau, David Manlove: Vertex and edge covers with clustering properties: Complexity and algorithms. J. Discrete Algorithms 7(2): 149-167 (2009)
2008
138 Carlos Martín-Vide, Friedrich Otto, Henning Fernau: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers Springer 2008
137EEMichael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. AAIM 2008: 188-199
136EEHenning Fernau, Daniel Raible: A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63
135 Henning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta: Global r-alliances and total domination. CTW 2008: 98-101
134EEGuoqiang Bai, Henning Fernau: Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. FAW 2008: 67-78
133EEStefan Gulan, Henning Fernau: An Optimal Construction of Finite Automata from Regular Expressions. FSTTCS 2008
132EEDaniel Raible, Henning Fernau: Power Domination in O*(1.7548n) Using Reference Search Trees. ISAAC 2008: 136-147
131EEDaniel Raible, Henning Fernau: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562
130 Stefan Gulan, Henning Fernau: Local elimination-strategies in automata for shorter regular expressions. SOFSEM (2) 2008: 46-57
129EEHenning Fernau, Daniel Raible: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156
128EEHenning Fernau: Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms 2008
127EEDaniel Raible, Henning Fernau: A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach CoRR abs/0803.3531: (2008)
126EEJianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang: A Parameterized Perspective on P2-Packings CoRR abs/0804.0570: (2008)
125EEHenning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR abs/0810.4796: (2008)
124EEHenning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR abs/0811.1875: (2008)
123EEHenning Fernau: Parameterized algorithmics for linear arrangement problems. Discrete Applied Mathematics 156(17): 3166-3177 (2008)
122EEHenning Fernau, Joseph F. Ryan, Kiki A. Sugeng: A sum labelling for the generalised friendship graph. Discrete Mathematics 308(5-6): 734-740 (2008)
121EEHenning Fernau, Ralf Stiebe: Blind Counter Automata on omega-Words. Fundam. Inform. 83(1-2): 51-64 (2008)
120EEJürgen Dassow, Henning Fernau: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Inf. Comput. 206(9-10): 1095-1103 (2008)
119EEHenning Fernau: ROMAN DOMINATION: a parameterized perspective. Int. J. Comput. Math. 85(1): 25-38 (2008)
118EEVida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008)
117EEFaisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4): 541-552 (2008)
2007
116 Henning Fernau: Dynamic programming for queen domination. CTW 2007: 43-48
115 Henning Fernau, Daniel Raible: Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70
114EEDaniel Raible, Henning Fernau: Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007
113EEHenning Fernau: Programmed Grammars with Rule Queues. Int. J. Found. Comput. Sci. 18(6): 1209-1213 (2007)
112 Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics 12(1-2): 117-138 (2007)
111 Henning Bordihn, Henning Fernau: The Degree of Parallelism. Journal of Automata, Languages and Combinatorics 12(1-2): 25-47 (2007)
110EEJianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37(4): 1077-1106 (2007)
2006
109 Henning Fernau, David Manlove: Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. ACiD 2006: 69-84
108EEHenning Fernau: Parameterized Algorithms for Hitting Set: The Weighted Case. CIAC 2006: 332-343
107EEHenning Fernau: edge dominating set: Efficient Enumeration-Based Exact Algorithms. IWPEC 2006: 142-153
106EEFaisal N. Abu-Khzam, Henning Fernau: Kernels: Annotated, Proper and Induced. IWPEC 2006: 264-275
105EEFrank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond: NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245
104EEHenning Fernau: ROMAN DOMINATION: A Parameterized Perspective. SOFSEM 2006: 262-271
103EEHenning Fernau: Parameterized Algorithms for Hitting Set: the Weighted Case. Electronic Colloquium on Computational Complexity (ECCC) 13(072): (2006)
102EEFaisal N. Abu-Khzam, Henning Fernau: Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electronic Notes in Discrete Mathematics 25: 1-6 (2006)
101EEHenning Fernau: Speeding up Exact Algorithms With High Probability. Electronic Notes in Discrete Mathematics 25: 57-59 (2006)
100EEHenning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide: Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1-3): 67-81 (2006)
2005
99 Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58
98EEHenning Fernau: Algorithms for Learning Regular Expressions. ALT 2005: 297-311
97EEHenning Fernau, Michael Kaufmann, Mathias Poths: Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469
96EEHenning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics. SOFSEM 2005: 137-146
95EEJianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280
94EEHenning Fernau, Rudolf Freund, Markus Holzer: Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Inform. 64(1-4): 159-170 (2005)
93EEJochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005)
92EEHenning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics. J. Graph Algorithms Appl. 9(2): 205-238 (2005)
2004
91EEBradford Starkie, Henning Fernau: The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. ICGI 2004: 235-247
90EEHenning Fernau: Extracting Minimum Length Document Type Definitions Is NP-Hard. ICGI 2004: 277-278
89EEHenning Fernau, David W. Juedes: A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS 2004: 488-499
88EEHenning Fernau: Identifying Terminal Distinguishable Languages. Ann. Math. Artif. Intell. 40(3-4): 263-282 (2004)
87EEHenning Fernau: Parametric Duality: Kernel Sizes and Algorithmics Electronic Colloquium on Computational Complexity (ECCC)(027): (2004)
86EEHenning Fernau: A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set Electronic Colloquium on Computational Complexity (ECCC)(073): (2004)
85EEHenning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics Electronic Colloquium on Computational Complexity (ECCC)(078): (2004)
84EEJochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004)
2003
83 Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt: On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9
82 Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130
81EEVida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed Parameter Algorithms for one-sided crossing minimization Revisited. Graph Drawing 2003: 332-344
80 Henning Fernau: Education(al) matters: teaching P versus NP. Bulletin of the EATCS 80: 237-246 (2003)
79EEHenning Fernau: Parallel Grammars: A Phenomenology. Grammars 6(1): 25-87 (2003)
78EEHenning Fernau, Alexander Meduna: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86(5): 235-240 (2003)
77EEJochen Alber, Henning Fernau, Rolf Niedermeier: Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003)
76EEHenning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. 1-3(299): 633-662 (2003)
75 Henning Fernau: Identification of function distinguishable languages. Theor. Comput. Sci. 290(3): 1679-1711 (2003)
74 Henning Fernau, Alexander Meduna: On the degree of scattered context-sensitivity. Theor. Comput. Sci. 290(3): 2121-2124 (2003)
73EEHenning Fernau: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296(2): 225-251 (2003)
2002
72 Pieter W. Adriaans, Henning Fernau, Menno van Zaanen: Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings Springer 2002
71EEHenning Fernau: On Parameterized Enumeration. COCOON 2002: 564-573
70EEHenning Fernau: Learning Tree Languages from Text. COLT 2002: 153-168
69EEHenning Fernau: Fragmentation: Enhancing Identifiability. ICGI 2002: 92-105
68EEHenning Fernau, Agnes Radl: Algorithms for Learning Function Distinguishable Regular Languages. SSPR/SPR 2002: 64-73
67EEHenning Fernau: Graph Separator Algorithms: A Refined Analysis. WG 2002: 186-197
66EEJochen 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)
65 Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. Journal of Automata, Languages and Combinatorics 7(4): 487-503 (2002)
64EEHenning Fernau, Ralf Stiebe: Sequential grammars and automata with valences. Theor. Comput. Sci. 276(1-2): 377-405 (2002)
63 Henning Fernau: Even linear simple matrix languages: formal language properties and grammatical inference. Theor. Comput. Sci. 289(1): 425-456 (2002)
2001
62EEJochen Alber, Henning Fernau, Rolf Niedermeier: Graph Separators: A Parameterized View. COCOON 2001: 318-327
61EEHenning Fernau, Ralf Stiebe: Valuated and Valence Grammars: An Algebraic View. Developments in Language Theory 2001: 281-292
60EEJochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272
59EEFalk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier: Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243
58EEHenning Fernau: Nonterminal Complexity of Programmed Grammars. MCU 2001: 202-213
57EEJochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122
56EEHenning Fernau: Learning XML Grammars. MLDM 2001: 73-87
55EEHenning Fernau: Approximative Learning of Regular Languages. SOFSEM 2001: 223-232
54 Henning Fernau, Ralf Stiebe: Valence Grammars with Target Sets. Words, Semigroups, and Transductions 2001: 129-140
53EEHenning Fernau: Parallel communicating grammar systems with terminal transmission. Acta Inf. 37(7): 511-540 (2001)
52EEJochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems Electronic Colloquium on Computational Complexity (ECCC) 8(23): (2001)
51 Henning Fernau, Ralf Stiebe: Valences in Lindenmayer Systems. Fundam. Inform. 45(4): 329-358 (2001)
50 Henning Fernau, Ludwig Staiger: Iterated Function Systems and Control Languages. Inf. Comput. 168(2): 125-143 (2001)
49 Henning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001)
48EEHenning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001)
2000
47EEHenning Fernau: Identification of Function Distinguishable Languages. ALT 2000: 116-130
46EEHenning Fernau: Terminal distinguishable languages. AMAI 2000
45 Henning Fernau, José M. Sempere: Permutations and Control Sets for Learning Non-regular Language Families. ICGI 2000: 75-88
44EEHenning Fernau: k-gram Extensions of Terminal Distinguishable Languages. ICPR 2000: 2125-2128
43 Henning Fernau, Markus Holzer: External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 104-120
42EEJochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier: Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110
41 Henning Fernau: Regulated Grammars under Leftmost Derivation. Grammars 3(1): 37-62 (2000)
1999
40EEHenning Fernau: Efficient Learning of Some Linear Matrix Languages. COCOON 1999: 221-230
39 Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. Developments in Language Theory 1999: 153-163
38 Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems 1999: 157-181
37 Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems 1999: 284-296
36EEHenning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS 1999: 387-397
35 Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999)
34 Jürgen Dassow, Henning Fernau, Gheorghe Paun: On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. 10(1): 61-80 (1999)
33 Henning Fernau, Frank Stephan: Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer. Journal of Automata, Languages and Combinatorics 4(2): 117-152 (1999)
1998
32 Henning Fernau, Rudolf Freund, Markus Holzer: The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56
31EEHenning Fernau, Ludwig Staiger: IFS and Control Languages. MFCS 1998: 740-750
30EEHenning Fernau: Regulated Grammars with Leftmost Derivation. SOFSEM 1998: 322-331
29 Henning Fernau, Rudolf Freund, Markus Holzer: Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291
28EEHenning Fernau, Dietmar Wätjen: Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. Theor. Comput. Sci. 194(1-2): 35-55 (1998)
1997
27 Henning Fernau, Frank Stephan: How Powerful is Unconditional Transfer? - When UT meets AC. Developments in Language Theory 1997: 249-260
26 Henning Fernau, Markus Holzer, Rudolf Freund: Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272
25EEHenning Fernau, Ralf Stiebe: Regulations by Valences. MFCS 1997: 239-248
24 Henning Fernau, Markus Holzer: Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages 1997: 10-26
23 Henning Fernau, Rudolf Freund: Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages 1997: 95-118
22EEHenning Fernau: Unconditional Transfer in Regulated Rewriting. Acta Inf. 34(11): 837-857 (1997)
21 Henning Fernau: Graph-Controlled Grammars as Language Acceptors. Journal of Automata, Languages and Combinatorics 2(2): 79-92 (1997)
1996
20EEHenning Fernau, Klaus-Jörn Lange, Klaus Reinhardt: Advocating Ownership. FSTTCS 1996: 286-297
19EEHenning Fernau: On Unconditional Transfer. MFCS 1996: 348-359
18 Henning Fernau, Rudolf Freund: Bounded Parallelism in Array Grammars Used for Character Recognition. SSPR 1996: 40-49
17EEHenning Fernau, Markus Holzer: Accepting Multi-Agent Systems II. Acta Cybern. 12(4): 361-380 (1996)
16 Henning Fernau: Closure Properties of Ordered Languages. Bulletin of the EATCS 58: (1996)
15 Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3): (1996)
14 Henning Fernau: On Grammar and Language Families. Fundam. Inform. 25(1): 17-34 (1996)
13 Henning Fernau: Remarks on Propagating Partition-Limited ETOL Systems. J. UCS 2(11): 745-755 (1996)
12 Henning Bordihn, Henning Fernau: Accepting Grammars and Systems via Context Condition Grammars. Journal of Automata, Languages and Combinatorics 1(2): 97-112 (1996)
11 Henning Fernau: Membership for k-Limited ET0L Languages Is Not Decidable. Journal of Automata, Languages and Combinatorics 1(4): 243-246 (1996)
1995
10 Henning Bordihn, Henning Fernau: Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208
9EEHenning Fernau: Valuations Regular Expressions, and Fractal Geometry. Appl. Algebra Eng. Commun. Comput. 7(1): 59-75 (1995)
8 Henning Fernau: A predicate for separating language classes. Bulletin of the EATCS 56: (1995)
7EEHenning Fernau: A Note on Uniformly Limited ETOL Systems with Unique Interpretation. Inf. Process. Lett. 54(4): 199-204 (1995)
6EEHenning Fernau: Valuations of Languages, with Applications to Fractal Geometry. Theor. Comput. Sci. 137(2): 177-217 (1995)
1994
5EEHenning Fernau, Ludwig Staiger: Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22
4 Henning Fernau: Membership for 1-Limited ET0L Languages Is Not Decidable. Elektronische Informationsverarbeitung und Kybernetik 30(4): 191-211 (1994)
1993
3 Henning Fernau: Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. Developments in Language Theory 1993: 90-101
2 Henning Fernau: Adult Languages of Propagating Systems with Restricted Parallelism. Elektronische Informationsverarbeitung und Kybernetik 29(5): 249-267 (1993)
1991
1 Henning Fernau: On Function-limited Lindenmayer Systems. Elektronische Informationsverarbeitung und Kybernetik 27(1): 21-53 (1991)

Coauthor Index

1Faisal N. Abu-Khzam [99] [102] [106] [117]
2Pieter W. Adriaans [72]
3Jochen Alber [42] [52] [57] [60] [62] [66] [77] [84] [93]
4Guoqiang Bai [134]
5Sergio Bermudo [141]
6Hans L. Bodlaender [42] [66]
7Henning Bordihn [10] [12] [15] [35] [82] [100] [111]
8Ljiljana Brankovic [143]
9Jianer Chen [95] [110] [126]
10Jürgen Dassow [34] [120]
11Frank K. H. A. Dehne [105]
12Vida Dujmovic [81] [118]
13Stefan Edelkamp [59]
14Gábor Erdélyi [144] [149]
15Hongbing Fan [57] [93]
16Michael R. Fellows (Mike Fellows) [57] [93] [105] [137]
17Fedor V. Fomin [125] [146]
18Rudolf Freund [18] [23] [26] [29] [32] [37] [38] [48] [76] [94] [112]
19Serge Gaspers [124] [148]
20Judy Goldsmith [144] [149]
21Stefan Gulan [130] [133]
22Torben Hagerup [83]
23Markus Holzer [15] [17] [24] [26] [29] [32] [35] [37] [38] [43] [48] [65] [76] [82] [94] [100]
24Falk Hüffner [59]
25David W. Juedes [89]
26Iyad A. Kanj [95] [110]
27Michael Kaufmann [81] [97] [118]
28Ton Kloks (Antonius J. J. Kloks) [66]
29Joachim Kneis [143]
30Dieter Kratsch [143] [148]
31Klaus-Jörn Lange [20]
32Alexander Langer [143]
33Michael A. Langston [99] [117]
34Mathieu Liedloff [143] [148]
35Daniel Lokshtanov [125] [146]
36Vincenzo Manca [100]
37David Manlove [109] [139]
38Carlos Martín-Vide [100] [138]
39Nicholas Mattei [144] [149]
40Alexander Meduna [74] [78]
41Rolf Niedermeier [36] [42] [49] [52] [57] [59] [60] [62] [66] [77] [84] [93]
42Dan Ning [126]
43Naomi Nishimura [83]
44Marion Oswald [112]
45Friedrich Otto [138]
46Gheorghe Paun [34]
47Mathias Poths [97]
48Elena Prieto [105]
49Agnes Radl [68]
50Prabhakar Ragde [83]
51Daniel Raible [114] [115] [124] [125] [126] [127] [129] [131] [132] [136] [143] [144] [145] [146] [147] [148] [149]
52Klaus Reinhardt [20] [39] [83] [112]
53Juan Alberto Rodríguez-Velazquez [135] [142]
54Frances A. Rosamond [57] [93] [105]
55Peter Rossmanith [143]
56Jörg Rothe [144] [149]
57Joseph F. Ryan [122]
58Saket Saurabh [125] [146]
59José M. Sempere [45]
60Jose Maria Sigarreta [135] [141] [142]
61Ludwig Staiger [5] [31] [39] [50]
62Bradford Starkie [91]
63Ulrike Stege [57] [93]
64Alexey A. Stepanov [124]
65Frank Stephan [27] [33]
66Ralf Stiebe [25] [51] [54] [61] [64] [121]
67Kiki A. Sugeng [122]
68Yngve Villanger [125] [146]
69Jianxin Wang [126]
70Dietmar Wätjen [28]
71Ge Xia [95] [110]
72Menno van Zaanen [72]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)