Fedor V. Fomin

	2012
214		Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger: k-Gap Interval Graphs. LATIN 2012: 350-361
213		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: Bidimensionality and geometric graphs. SODA 2012: 1563-1575
212		Fedor V. Fomin, Yngve Villanger: Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746
211		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on H-minor-free graphs. SODA 2012: 82-93
210		Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440
209		Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh: Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012)
208		Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012)
207		Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen: Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012)
206		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation and Optimal FPT Algorithms CoRR abs/1204.4230: (2012)
205		Fedor V. Fomin, Saket Saurabh, Yngve Villanger: A Polynomial kernel for Proper Interval Vertex Deletion CoRR abs/1204.4880: (2012)
204		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao: Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012)
203		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger: Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012)
202		Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012)
201		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012)
	2011
200		Fedor V. Fomin, Ioan Todinca, Yngve Villanger: Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298
199		Fedor V. Fomin, Geevarghese Philip, Yngve Villanger: Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175
198		Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited. IPEC 2011: 13-26
197		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Bidimensionality and EPTAS. SODA 2011: 748-759
196		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200
195		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger: Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410
194		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011)
193		Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? Algorithmica 61(4): 839-856 (2011)
192		Fedor V. Fomin, Yngve Villanger: Subexponential Parameterized Algorithm for Minimum Fill-in CoRR abs/1104.2230: (2011)
191		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: Bidimensionality and Geometric Graphs CoRR abs/1107.2221: (2011)
190		Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited CoRR abs/1109.4729: (2011)
189		Fedor V. Fomin, Michal Pilipczuk: Jungles, bundles, and fixed parameter tractability CoRR abs/1112.1538: (2011)
188		Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger: k-Gap Interval Graphs CoRR abs/1112.3244: (2011)
187		Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing CoRR abs/1112.4419: (2011)
186		Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011)
185		Michael R. Fellows, Fedor V. Fomin, Gregory Gutin: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011)
184		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2): 143-153 (2011)
183		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16): 814-818 (2011)
182		Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen: Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011)
181		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction obstructions for treewidth. J. Comb. Theory, Ser. B 101(5): 302-314 (2011)
180		Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6): 1071-1078 (2011)
179		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
178		Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6): 1159-1171 (2011)
177		Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Strengthening Erdös-Pósa property for minor-closed graph classes. Journal of Graph Theory 66(3): 235-240 (2011)
176		Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the complexity of reconstructing H-free graphs from their Star Systems. Journal of Graph Theory 68(2): 113-124 (2011)
175		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discrete Math. 25(3): 1331-1348 (2011)
174		Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011)
173		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. 412(29): 3530-3536 (2011)
172		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011)
171		Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011)
170		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011)
	2010
169		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010
168		Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh: The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43
167		Fedor V. Fomin: Kernelization. CSR 2010: 107-108
166		Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109
165		Fedor V. Fomin: Protrusions in Graphs and Their Applications. IPEC 2010: 3
164		Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh: Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348
163		Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh: Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83
162		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502
161		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Bidimensionality and Kernels. SODA 2010: 503-510
160		Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262
159		Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394
158		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. SWAT 2010: 273-284
157		Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333
156		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximation Algorithms for Domination Search. WAOA 2010: 130-141
155		Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010)
154		Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR abs/1001.0821: (2010)
153		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Bidimensionality and EPTAS CoRR abs/1005.5449: (2010)
152		Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization CoRR abs/1010.1365: (2010)
151		Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos: Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31(7): 1617-1628 (2010)
150		Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010)
149		Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010)
148		Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010)
147		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)
146		Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010)
145		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010)
	2009
144		Jianer Chen, Fedor V. Fomin: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers Springer 2009
143		Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46
142		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
141		Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638
140		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Subexponential Algorithms for Partial Cover Problems. FSTTCS 2009: 193-201
139		Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47
138		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474
137		Omid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82
136		Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491
135		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282
134		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
133		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
132		Henning 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
131		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
130		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158
129		Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: An Exact Algorithm for Minimum Distortion Embedding. WG 2009: 112-121
128		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
127		Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009)
126		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
125		Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR abs/0903.0938: (2009)
124		Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
123		Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for Feedback Arc Set In Tournaments CoRR abs/0907.2165: (2009)
122		Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR abs/0907.3208: (2009)
121		Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations CoRR abs/0909.5278: (2009)
120		Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh: Faster Algorithms for Finding and Counting Subgraphs CoRR abs/0912.2371: (2009)
119		Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics 157(12): 2726-2736 (2009)
118		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009)
117		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): (2009)
116		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning Directed Trees with Many Leaves. SIAM J. Discrete Math. 23(1): 466-476 (2009)
	2008
115		Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW 2008: 2-6
114		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441
113		Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12
112		Fedor V. Fomin, Yngve Villanger: Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221
111		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
110		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
109		Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
108		Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205
107		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
106		Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
105		Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640
104		Fedor V. Fomin, Dimitrios M. Thilikos: Branchwidth of Graphs. Encyclopedia of Algorithms 2008
103		Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni: Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008
102		Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms 5(1): (2008)
101		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008)
100		Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon: On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52(2): 293-307 (2008)
99		Omid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems CoRR abs/0802.1722: (2008)
98		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008)
97		Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics CoRR abs/0803.1321: (2008)
96		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR abs/0804.3028: (2008)
95		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs CoRR abs/0809.3646: (2008)
94		Henning 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)
93		Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential parameterized algorithms. Computer Science Review 2(1): 29-39 (2008)
92		Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008)
91		Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger: Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008)
90		Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos: Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008)
89		Fedor V. Fomin, Dimitrios M. Thilikos: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3): 236-245 (2008)
	2007
88		Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
87		Fedor V. Fomin, Alexey A. Stepanov: Counting Minimum Weighted Dominating Sets. COCOON 2007: 165-175
86		Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
85		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
84		Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms. ICALP 2007: 15-27
83		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
82		Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433
81		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
80		Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315
79		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR abs/0707.1095: (2007)
78		Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007)
77		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)
76		Fedor V. Fomin, Dimitrios M. Thilikos: On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory 55(1): 42-54 (2007)
75		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)
74		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007)
	2006
73		Fedor V. Fomin: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers Springer 2006
72		Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
71		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163
70		Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
69		Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191
68		Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279
67		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25
66		Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183
65		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)
64		Fedor V. Fomin, Kjartan Høie: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5): 191-196 (2006)
63		Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms 4(4): 499-510 (2006)
62		Fedor V. Fomin, Dimitrios M. Thilikos: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51(1): 53-81 (2006)
61		Fedor V. Fomin, Dimitrios M. Thilikos: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Comput. 36(2): 281-309 (2006)
	2005
60		Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106
59		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171
58		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203
57		Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov: Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC 2005: 573-582
56		Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375
55		Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384
54		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Transactions on Algorithms 1(1): 33-47 (2005)
53		Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the EATCS 87: 47-77 (2005)
52		Hans L. Bodlaender, Fedor V. Fomin: Tree decompositions with small cost. Discrete Applied Mathematics 145(2): 143-154 (2005)
51		Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov: On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics 22: 157-162 (2005)
50		Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca: Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics 22: 213-216 (2005)
49		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005)
48		Hans L. Bodlaender, Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005)
	2004
47		Fedor V. Fomin, Dimitrios M. Thilikos: A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141
46		Fedor V. Fomin, Dieter Kratsch, Ioan Todinca: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580
45		Fedor V. Fomin, Dimitrios M. Thilikos: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592
44		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
43		Hans L. Bodlaender, Fedor V. Fomin: Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190
42		Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214
41		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. SODA 2004: 830-839
40		Fedor V. Fomin, Dimitrios M. Thilikos: A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67
39		Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256
38		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)
37		Fedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
36		Fedor V. Fomin: Searching expenditure and interval graphs. Discrete Applied Mathematics 135(1-3): 97-104 (2004)
35		Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: AT-free graphs: linear bounds for the oriented diameter. Discrete Applied Mathematics 141(1-3): 135-148 (2004)
34		Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. Electronic Notes in Discrete Mathematics 17: 157-162 (2004)
33		Fedor V. Fomin, Martín Matamala, Ivan Rapaport: Complexity of approximating the oriented diameter of chordal graphs. Journal of Graph Theory 45(4): 255-269 (2004)
32		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. SIAM J. Discrete Math. 18(3): 501-511 (2004)
31		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)
30		Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004)
	2003
29		Fedor V. Fomin, Dimitrios M. Thilikos: Dominating Sets and Local Treewidth. ESA 2003: 221-229
28		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85
27		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP 2003: 829-844
26		Fedor V. Fomin, Dimitrios M. Thilikos: Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177
25		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
24		Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
23		Fedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
22		Fedor V. Fomin, Dimitrios M. Thilikos: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131(2): 323-335 (2003)
21		Fedor V. Fomin: Pathwidth of Planar and Line Graphs. Graphs and Combinatorics 19(1): 91-99 (2003)
	2002
20		Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
19		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
18		Hans L. Bodlaender, Fedor V. Fomin: Tree Decompositions with Small Cost. SWAT 2002: 378-387
17		Fedor V. Fomin, Martín Matamala, Ivan Rapaport: The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222
16		Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
15		Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
14		Fedor V. Fomin, Andrzej Lingas: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002)
13		Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002)
12		Hans L. Bodlaender, Fedor V. Fomin: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002)
	2001
11		Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475
10		Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating Minimum Cocolourings. FCT 2001: 118-125
9		Fedor V. Fomin, Andrzej Lingas: Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515
8		Fedor V. Fomin, Hans L. Bodlaender: Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176
7		Fedor V. Fomin, Dimitrios M. Thilikos: On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188
6		Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: Bilateral Orientations and Domination. Electronic Notes in Discrete Mathematics 7: 26-29 (2001)
	2000
5		Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. WG 2000: 161-171
4		Fedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
	1999
3		Fedor V. Fomin: Note on a Helicopter Search Problem on Graphs. Discrete Applied Mathematics 95(1-3): 241-249 (1999)
	1998
2		Fedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371
1		Fedor V. Fomin: Helicopter Search Problems, Bandwidth and Pathwidth. Discrete Applied Mathematics 85(1): 59-70 (1998)

Coauthor Index

1	Isolde Adler	[157] [166] [171] [208]
2	Noga Alon	[78] [79] [83] [85] [98] [116]
3	Omid Amini	[99] [113] [137] [178]
4	Stéphane Bessy	[123] [139] [180]
5	Daniel Binkele-Raible (Daniel Raible)	[94] [132]
6	Hans L. Bodlaender	[8] [12] [18] [20] [31] [43] [48] [52] [60] [72] [124] [141] [155] [202] [207]
7	Hajo Broersma (H. J. Broersma)	[15] [16] [19] [20] [25] [31] [42] [65] [75] [77] [128] [134]
8	Jianer Chen	[82] [92] [144]
9	Johanne Cohen	[68]
10	Nathann Cohen	[125] [143] [149]
11	Marek Cygan	[190] [198]
12	Erik D. Demaine	[27] [32] [41] [44] [49] [54]
13	Frederic Dorn	[60] [66] [84] [93] [105] [154] [155] [157] [160] [166] [171] [208]
14	Feodor F. Dragan	[107] [111] [170] [179]
15	Michael R. Fellows (Mike Fellows)	[88] [96] [136] [138] [184] [185] [203]
16	Henning Fernau	[94] [132] [164] [168]
17	Jirí Fiala	[11] [30]
18	Aleksei V. Fishkin	[11] [30]
19	Pierre Fraigniaud	[56] [90] [127] [174] [186]
20	Serge Gaspers	[69] [70] [86] [100] [106] [122] [123] [126] [135] [139] [146] [150] [180] [188] [214]
21	Petr A. Golovach	[2] [4] [23] [25] [75] [81] [95] [107] [109] [110] [111] [118] [130] [131] [133] [134] [142] [145] [147] [150] [156] [158] [162] [170] [172] [175] [179] [181] [182] [188] [193] [194] [201] [207] [210] [214]
22	Fabrizio Grandoni	[51] [53] [57] [58] [67] [71] [101] [102] [103] [114] [117] [163] [209]
23	Gregory Gutin	[78] [79] [83] [85] [98] [116] [125] [143] [149] [185]
24	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[27] [32] [41] [44] [49] [54]
25	Alexander Hall	[109] [193]
26	Pinar Heggernes	[28] [38] [59] [68] [74] [80] [148] [195]
27	Pim van 't Hof	[128]
28	Kjartan Høie	[64]
29	Eun Jung Kim	[125] [143] [149]
30	Arie M. C. A. Koster	[72] [202]
31	Rastislav Kralovic (Rastislav Královic)	[77]
32	Jan Kratochvíl	[19] [65] [81] [108] [110] [118] [145] [176] [194]
33	Dieter Kratsch	[5] [10] [13] [24] [37] [39] [46] [53] [58] [59] [67] [68] [71] [72] [74] [81] [91] [101] [103] [106] [114] [117] [118] [146] [150] [194] [195] [202]
34	Stefan Kratsch	[187]
35	Stephan Kreutzer	[174] [186]
36	Michael Krivelevich	[78] [79] [83] [85] [98] [116]
37	Gregory Kucherov	[68]
38	Erik Jan van Leeuwen	[182] [188] [190] [198] [207] [214]
39	Mathieu Liedloff	[81] [106] [118] [146] [194]
40	Andrzej Lingas	[9] [14]
41	Yang Liu	[82] [92]
42	Daniel Lokshtanov	[88] [94] [96] [108] [120] [124] [129] [130] [132] [133] [136] [138] [140] [141] [147] [152] [153] [154] [158] [160] [161] [162] [163] [164] [169] [172] [173] [176] [183] [184] [191] [196] [197] [201] [203] [204] [206] [209] [211] [213]
43	Elena Losievskaja	[96] [138]
44	Songjian Lu	[82] [92]
45	Federico Mancini	[108] [176]
46	Martín Matamala	[6] [17] [33] [35]
47	Frédéric Mazoit	[55] [119]
48	Rodica Mihai	[80] [148]
49	Matús Mihalák	[109] [193]
50	Neeldhara Misra	[152] [196] [206]
51	Matthias Mnich	[164]
52	Haiko Müller	[5] [24] [37]
53	Jaroslav Nesetril (Jarik Nesetril)	[15] [16]
54	Nicolas Nisse	[56] [127] [145]
55	Jean-Christophe Novelli	[10] [13]
56	Yota Otachi	[207]
57	Sang-il Oum	[151]
58	Charis Papadopoulos	[195]
59	Christophe Paul	[123] [139] [180]
60	Daniël Paulusma	[128] [134]
61	Eelko Penninkx	[60] [124] [141] [155]
62	Anthony Perez	[123] [139] [180]
63	Geevarghese Philip	[152] [164] [168] [196] [199]
64	Marcin Pilipczuk	[187]
65	Michal Pilipczuk	[187] [189]
66	Erich Prisner	[6] [35]
67	Artem V. Pyatkin	[20] [31] [51] [57] [69] [100] [102]
68	Venkatesh Raman	[120] [140] [153] [154] [160] [169] [183] [197] [204]
69	B. V. Raghavendra Rao	[120] [204]
70	Ivan Rapaport	[6] [17] [33] [35]
71	Igor Razgon	[100]
72	Frances A. Rosamond	[88] [96] [136] [138] [184] [203]
73	Ignasi Sau (Ignasi Sau Valls)	[157] [166] [171] [208]
74	Saket Saurabh	[70] [78] [79] [83] [85] [86] [88] [94] [96] [98] [99] [106] [113] [115] [116] [120] [122] [123] [124] [125] [126] [129] [132] [133] [135] [136] [137] [138] [139] [140] [141] [143] [146] [147] [149] [150] [152] [153] [154] [160] [161] [162] [163] [164] [168] [169] [173] [177] [178] [180] [183] [184] [191] [196] [197] [203] [204] [205] [206] [209] [211] [213]
75	Alexey A. Stepanov	[51] [57] [87] [102] [126]
76	Karol Suchan	[145] [188] [214]
77	Stefan Szeider	[88] [184] [188] [214]
78	Jan Arne Telle	[28] [38] [108] [176]
79	Dimitrios M. Thilikos	[7] [22] [26] [27] [29] [32] [34] [40] [41] [44] [45] [47] [49] [50] [54] [61] [62] [63] [66] [72] [76] [84] [89] [90] [93] [95] [104] [105] [115] [124] [131] [141] [142] [151] [156] [157] [161] [166] [171] [174] [175] [177] [181] [186] [202] [208] [211]
80	Stéphan Thomassé	[122] [123] [135] [139] [180]
81	Carsten Thomassen	[88] [184]
82	Ioan Todinca	[46] [50] [55] [91] [119] [200]
83	Martin Vatshelle	[188] [214]
84	Elias Vicari	[109] [193]
85	Yngve Villanger	[82] [91] [92] [94] [97] [112] [121] [132] [136] [159] [187] [188] [192] [195] [199] [200] [203] [205] [212] [214]
86	Peter Widmayer	[109] [193]
87	Gerhard J. Woeginger	[15] [16] [19] [20] [25] [31] [39] [42] [65] [75] [77]
88	Anders Yeo	[125] [143] [149]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page