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

Fedor V. Fomin 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
131EENathann 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
130EEFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
129EEMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474
128EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82
127EEMichael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491
126EEFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
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. STACS 2009: 421-432
124EEFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
123EEFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009)
122EEFedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
121EENathann 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)
120EEHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
119EESté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)
118EEFedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR abs/0907.3208: (2009)
117EEFedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations CoRR abs/0909.5278: (2009)
116EEFedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics 157(12): 2726-2736 (2009)
115EEFedor 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)
114EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): (2009)
2008
113 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
112EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441
111EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008
110EEFedor V. Fomin, Yngve Villanger: Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221
109EEFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
108EEFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
107EEFedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
106EEFedor 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
105EEFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
104EEFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
103EEFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640
102EEFedor V. Fomin, Dimitrios M. Thilikos: Branchwidth of Graphs. Encyclopedia of Algorithms 2008
101EEDieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni: Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008
100EEFedor 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)
99EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008)
98EEFedor 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)
97EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems CoRR abs/0802.1722: (2008)
96EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008)
95EEFedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics CoRR abs/0803.1321: (2008)
94EEMichael 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)
93EEFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs CoRR abs/0809.3646: (2008)
92EEHenning 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)
91EEFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential parameterized algorithms. Computer Science Review 2(1): 29-39 (2008)
90EEJianer 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)
89EEFedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger: Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008)
88EEFedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos: Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008)
87EEFedor V. Fomin, Dimitrios M. Thilikos: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3): 236-245 (2008)
2007
86EEMichael 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
85EEFedor V. Fomin, Alexey A. Stepanov: Counting Minimum Weighted Dominating Sets. COCOON 2007: 165-175
84EEFedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
83EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
82EEFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms. ICALP 2007: 15-27
81EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
80EEJianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433
79EEFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
78EEFedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315
77EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR abs/0707.1095: (2007)
76EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007)
75EEHajo 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)
74EEFedor V. Fomin, Dimitrios M. Thilikos: On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory 55(1): 42-54 (2007)
73EEHajo 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)
72EEFedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007)
2006
71 Fedor V. Fomin: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers Springer 2006
70EEHans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
69EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163
68EEFedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
67EEFedor V. Fomin, Serge Gaspers, Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191
66EEJohanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279
65EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25
64EEFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183
63EEHajo 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)
62EEFedor V. Fomin, Kjartan Høie: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5): 191-196 (2006)
61EEFedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms 4(4): 499-510 (2006)
60EEFedor V. Fomin, Dimitrios M. Thilikos: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51(1): 53-81 (2006)
59EEFedor 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
58EEFrederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106
57EEFedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171
56EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203
55EEFedor 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
54EEFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375
53EEFedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384
52EEErik 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)
51 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)
50EEHans L. Bodlaender, Fedor V. Fomin: Tree decompositions with small cost. Discrete Applied Mathematics 145(2): 143-154 (2005)
49EEFedor 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)
48EEFedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca: Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics 22: 213-216 (2005)
47EEErik 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)
46EEHans L. Bodlaender, Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005)
2004
45EEFedor V. Fomin, Dieter Kratsch, Ioan Todinca: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580
44EEFedor V. Fomin, Dimitrios M. Thilikos: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592
43EEErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
42EEHans L. Bodlaender, Fedor V. Fomin: Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190
41EEHajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214
40EEErik 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
39EEFedor V. Fomin, Dimitrios M. Thilikos: A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67
38EEFedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256
37EEFedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)
36EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
35EEFedor V. Fomin: Searching expenditure and interval graphs. Discrete Applied Mathematics 135(1-3): 97-104 (2004)
34EEFedor 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)
33EEFedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. Electronic Notes in Discrete Mathematics 17: 157-162 (2004)
32EEFedor 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)
31EEErik 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)
30EEJirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004)
2003
29EEFedor V. Fomin, Dimitrios M. Thilikos: Dominating Sets and Local Treewidth. ESA 2003: 221-229
28EEFedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85
27EEErik 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
26EEFedor V. Fomin, Dimitrios M. Thilikos: Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177
25EEHajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
24EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
23EEFedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
22EEFedor V. Fomin, Dimitrios M. Thilikos: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131(2): 323-335 (2003)
21EEFedor V. Fomin: Pathwidth of Planar and Line Graphs. Graphs and Combinatorics 19(1): 91-99 (2003)
2002
20EEHans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
19EEHajo 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
18EEHans L. Bodlaender, Fedor V. Fomin: Tree Decompositions with Small Cost. SWAT 2002: 378-387
17EEFedor V. Fomin, Martín Matamala, Ivan Rapaport: The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222
16EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
15EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
14EEFedor V. Fomin, Andrzej Lingas: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002)
13EEFedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002)
12EEHans L. Bodlaender, Fedor V. Fomin: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002)
2001
11EEJirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475
10EEFedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating Minimum Cocolourings. FCT 2001: 118-125
9EEFedor V. Fomin, Andrzej Lingas: Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515
8EEFedor V. Fomin, Hans L. Bodlaender: Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176
7EEFedor V. Fomin, Dimitrios M. Thilikos: On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188
6EEFedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: Bilateral Orientations and Domination. Electronic Notes in Discrete Mathematics 7: 26-29 (2001)
2000
5EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. WG 2000: 161-171
4EEFedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
1999
3EEFedor V. Fomin: Note on a Helicopter Search Problem on Graphs. Discrete Applied Mathematics 95(1-3): 241-249 (1999)
1998
2EEFedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371
1EEFedor V. Fomin: Helicopter Search Problems, Bandwidth and Pathwidth. Discrete Applied Mathematics 85(1): 59-70 (1998)

Coauthor Index

1Noga Alon [76] [77] [81] [83] [96]
2Omid Amini [97] [111] [128]
3Stéphane Bessy [119]
4Hans L. Bodlaender [8] [12] [18] [20] [42] [46] [50] [58] [70] [120]
5Hajo Broersma (H. J. Broersma) [15] [16] [19] [20] [25] [41] [63] [73] [75]
6Jianer Chen [80] [90]
7Johanne Cohen [66]
8Nathann Cohen [121] [131]
9Erik D. Demaine [27] [31] [40] [43] [47] [52]
10Frederic Dorn [58] [64] [82] [91] [103]
11Feodor F. Dragan [105] [109]
12Michael R. Fellows (Mike Fellows) [86] [94] [127] [129]
13Henning Fernau [92] [125]
14Jirí Fiala [11] [30]
15Aleksei V. Fishkin [11] [30]
16Pierre Fraigniaud [54] [88] [123]
17Serge Gaspers [67] [68] [84] [98] [104] [118] [119] [122]
18Petr A. Golovach [2] [4] [23] [25] [73] [79] [93] [105] [107] [108] [109] [115] [124] [126] [130]
19Fabrizio Grandoni [49] [51] [55] [56] [65] [69] [99] [100] [101] [112] [114]
20Gregory Gutin [76] [77] [81] [83] [96] [121] [131]
21Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [27] [31] [40] [43] [47] [52]
22Alexander Hall [107]
23Pinar Heggernes [28] [37] [57] [66] [72] [78]
24Kjartan Høie [62]
25Eun Jung Kim [121] [131]
26Arie M. C. A. Koster [70]
27Rastislav Kralovic [75]
28Jan Kratochvíl [19] [63] [79] [106] [108] [115]
29Dieter Kratsch [5] [10] [13] [24] [36] [38] [45] [51] [56] [57] [65] [66] [69] [70] [72] [79] [89] [99] [101] [104] [112] [114] [115]
30Michael Krivelevich [76] [77] [81] [83] [96]
31Gregory Kucherov [66]
32Mathieu Liedloff [79] [104] [115]
33Andrzej Lingas [9] [14]
34Yang Liu [80] [90]
35Daniel Lokshtanov [86] [92] [94] [106] [120] [125] [126] [127] [129]
36Elena Losievskaja [94] [129]
37Songjian Lu [80] [90]
38Federico Mancini [106]
39Martín Matamala [6] [17] [32] [34]
40Frédéric Mazoit [53] [116]
41Rodica Mihai [78]
42Matús Mihalák [107]
43Haiko Müller [5] [24] [36]
44Jaroslav Nesetril (Jarik Nesetril) [15] [16]
45Nicolas Nisse [54] [123]
46Jean-Christophe Novelli [10] [13]
47Christophe Paul [119]
48Eelko Penninkx [58] [120]
49Anthony Perez [119]
50Erich Prisner [6] [34]
51Artem V. Pyatkin [20] [49] [55] [67] [98] [100]
52Daniel Raible [92] [125]
53Ivan Rapaport [6] [17] [32] [34]
54Igor Razgon [98]
55Frances A. Rosamond [86] [94] [127] [129]
56Saket Saurabh [68] [76] [77] [81] [83] [84] [86] [92] [94] [96] [97] [104] [111] [113] [118] [119] [120] [121] [122] [125] [126] [127] [128] [129] [131]
57Alexey A. Stepanov [49] [55] [85] [100] [122]
58Stefan Szeider [86]
59Jan Arne Telle [28] [37] [106]
60Dimitrios M. Thilikos [7] [22] [26] [27] [29] [31] [33] [39] [40] [43] [44] [47] [48] [52] [59] [60] [61] [64] [70] [74] [82] [87] [88] [91] [93] [102] [103] [113] [120] [124] [130]
61Stéphan Thomassé [118] [119]
62Carsten Thomassen [86]
63Ioan Todinca [45] [48] [53] [89] [116]
64Elias Vicari [107]
65Yngve Villanger [80] [89] [90] [92] [95] [110] [117] [125] [127]
66Peter Widmayer [107]
67Gerhard J. Woeginger [15] [16] [19] [20] [25] [38] [41] [63] [73] [75]
68Anders Yeo [121] [131]

Colors in the list of coauthors

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