Fedor V. Fomin Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013)
j96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh: Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013)
j95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petteri Kaski: Exact exponential algorithms. Commun. ACM 56(3): 80-88 (2013)
j94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013)
j93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013)
c111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Michal Pilipczuk: Jungles, bundles, and fixed parameter tractability. SODA 2013: 396-413
c110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Searching for better fill-in. STACS 2013: 8-19
c109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43
c108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103
i35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Michal Pilipczuk: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. CoRR abs/1301.7314 (2013)
i34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. CoRR abs/1304.4626 (2013)
i33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Long Circuits and Large Euler Subgraphs. CoRR abs/1304.5746 (2013)
i32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. CoRR abs/1304.5870 (2013)
i31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen: On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013)
i30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Pål G. Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk: A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013)
i29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach: Preventing Unraveling in Social Networks Gets Harder. CoRR abs/1304.6420 (2013)
2012
j92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh: Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012)
j91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012)
j90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics. Combinatorica 32(3): 289-308 (2012)
j88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos: Connected graph searching. Inf. Comput. 219: 1-16 (2012)
j87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. 78(5): 1606-1622 (2012)
j84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012)
j82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Pawel Pralat: Cops and Robber with Constraints. SIAM J. Discrete Math. 26(2): 571-590 (2012)
j81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Omid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. SIAM J. Discrete Math. 26(2): 695-717 (2012)
j80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Transactions on Algorithms 8(4): 38 (2012)
j79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On exact algorithms for treewidth. ACM Transactions on Algorithms 9(1): 12 (2012)
j78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012)
c107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dániel Marx: FPT Suspects and Tough Customers: Open Problems of Downey and Fellows. The Multivariate Algorithmic Revolution and Beyond 2012: 457-468
c106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Saket Saurabh, Yngve Villanger: A Polynomial Kernel for Proper Interval Vertex Deletion. ESA 2012: 467-478
c105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS 2012: 470-479
c104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse: To Satisfy Impatient Web Surfers Is Hard. FUN 2012: 166-176
c103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen: Making Life Easier for Firefighters. FUN 2012: 177-188
c102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk: Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536
c101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108
c100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: Bidimensionality and geometric graphs. SODA 2012: 1563-1575
c97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746
c96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440
e4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx (Eds.): The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7370, Springer 2012, isbn 978-3-642-30890-1
e3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petteri Kaski (Eds.): Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Lecture Notes in Computer Science 7357, Springer 2012, isbn 978-3-642-31154-3
i28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation and Optimal FPT Algorithms. CoRR abs/1204.4230 (2012)
i27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Saket Saurabh, Yngve Villanger: A Polynomial kernel for Proper Interval Vertex Deletion. CoRR abs/1204.4880 (2012)
i26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012)
i25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. CoRR abs/1210.0257 (2012)
2011
j77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael R. Fellows, Fedor V. Fomin, Gregory Gutin: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011)
j74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen: Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011)
j72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16): 814-818 (2011)
j71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
j69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6): 1159-1171 (2011)
j68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction obstructions for treewidth. J. Comb. Theory, Ser. B 101(5): 302-314 (2011)
j67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. 412(29): 3530-3536 (2011)
j61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011)
j60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Ioan Todinca, Yngve Villanger: Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298
c94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Geevarghese Philip, Yngve Villanger: Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175
c93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited. IPEC 2011: 13-26
c92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Bidimensionality and EPTAS. SODA 2011: 748-759
c91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200
c90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger: Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410
i24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Subexponential Parameterized Algorithm for Minimum Fill-in. CoRR abs/1104.2230 (2011)
i23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: Bidimensionality and Geometric Graphs. CoRR abs/1107.2221 (2011)
i22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited. CoRR abs/1109.4729 (2011)
i21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Michal Pilipczuk: Jungles, bundles, and fixed parameter tractability. CoRR abs/1112.1538 (2011)
i20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011)
i18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2010
j59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010)
j54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)
j53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010
c88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh: The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43
c87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Kernelization. CSR 2010: 107-108
c86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109
c85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh: Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348
c84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Protrusions in Graphs and Their Applications. IPEC 2010: 3
c83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh: Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83
c82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502
c81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Bidimensionality and Kernels. SODA 2010: 503-510
c80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262
c79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394
c78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. SWAT 2010: 273-284
c77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333
c76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximation Algorithms for Domination Search. WAOA 2010: 130-141
i17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. CoRR abs/1001.0821 (2010)
i16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Bidimensionality and EPTAS. CoRR abs/1005.5449 (2010)
i15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization. CoRR abs/1010.1365 (2010)
2009
j51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009)
j50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
j49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics 157(12): 2726-2736 (2009)
j48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)
j46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
c73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638
c72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Subexponential Algorithms for Partial Cover Problems. FSTTCS 2009: 193-201
c70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Omid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82
c69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282
c66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
c65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
c64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
c62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158
c61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh: An Exact Algorithm for Minimum Distortion Embedding. WG 2009: 112-121
e2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jianer Chen, Fedor V. Fomin (Eds.): Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5917, Springer 2009, isbn 978-3-642-11268-3
i14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. CoRR abs/0904.0727 (2009)
i12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/0907.3208 (2009)
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. CoRR abs/0909.5278 (2009)
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2008
j45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008)
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential parameterized algorithms. Computer Science Review 2(1): 29-39 (2008)
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos: Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3): 236-245 (2008)
c59no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441
c57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12
c56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221
c55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
c54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
c53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640
r2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: Branchwidth of Graphs. Encyclopedia of Algorithms 2008
r1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni: Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Omid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems. CoRR abs/0802.1722 (2008)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics. CoRR abs/0803.1321 (2008)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs. CoRR abs/0809.3646 (2008)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2007
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory 55(1): 42-54 (2007)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007)
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Alexey A. Stepanov: Counting Minimum Weighted Dominating Sets. COCOON 2007: 165-175
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms. ICALP 2007: 15-27
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007)
2006
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Kjartan Høie: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5): 191-196 (2006)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms 4(4): 499-510 (2006)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51(1): 53-81 (2006)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183
e1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin (Ed.): Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Lecture Notes in Computer Science 4271, Springer 2006, isbn 3-540-48381-0
2005
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin: Tree decompositions with small cost. Discrete Applied Mathematics 145(2): 143-154 (2005)
j27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca: Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics 22: 213-216 (2005)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005)
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca: Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384
2004
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Searching expenditure and interval graphs. Discrete Applied Mathematics 135(1-3): 97-104 (2004)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. Electronic Notes in Discrete Mathematics 17: 157-162 (2004)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004)
c26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin: Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256
2003
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131(2): 323-335 (2003)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Pathwidth of Planar and Line Graphs. Graphs and Combinatorics 19(1): 91-99 (2003)
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: Dominating Sets and Local Treewidth. ESA 2003: 221-229
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
2002
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Andrzej Lingas: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin: Tree Decompositions with Small Cost. SWAT 2002: 378-387
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Martín Matamala, Ivan Rapaport: The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222
2001
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: Bilateral Orientations and Domination. Electronic Notes in Discrete Mathematics 7: 26-29 (2001)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating Minimum Cocolourings. FCT 2001: 118-125
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Andrzej Lingas: Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Hans L. Bodlaender: Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dimitrios M. Thilikos: On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188
2000
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. WG 2000: 161-171
1999
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Note on a Helicopter Search Problem on Graphs. Discrete Applied Mathematics 95(1-3): 241-249 (1999)
1998
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin: Helicopter Search Problems, Bandwidth and Pathwidth. Discrete Applied Mathematics 85(1): 59-70 (1998)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371

Coauthor Index

1Isolde Adler
[j91] [j60] [c86] [c77]
2Noga Alon
[j46] [i7] [c45] [c43] [i2] [i1]
3Omid Amini
[j81] [j69] [c70] [c57] [i8]
4Lali Barrière
[j88]
5Stéphane Bessy
[j71] [c72] [i12]
6Daniel Binkele-Raible (Daniel Raible)
[j80] [c64] [i3]
7Hans L. Bodlaender
[i30] [j90] [j84] [j79] [e4] [j59] [c73] [i13] [c39] [j28] [j22] [c32] [j14] [c22] [j5] [c12] [c10] [c4]
8Hajo Broersma (H. J. Broersma)
[j97] [j94] [c66] [c61] [j37] [j35] [j33] [j14] [c21] [c13] [j8] [c12] [c11] [c9]
9Jianer Chen
[e2] [j42] [c42]
10Rajesh Hemant Chitnis
[i32] [i29]
11Johanne Cohen
[c35]
12Nathann Cohen
[j56] [c75] [i14]
13Marek Cygan
[c93] [i22]
14Erik D. Demaine
[j24] [j23] [j15] [c23] [c20] [c15]
15Frederic Dorn
[j91] [j85] [j60] [j59] [c86] [c80] [c77] [i17] [j43] [c49] [c44] [c33] [c32]
16Rodney G. Downey (Rod Downey)
[e4]
17Feodor F. Dragan
[j70] [j64] [c55] [c51]
18Pål G. Drange
[i30]
19Markus S. Dregi
[i30]
20Michael R. Fellows (Mike Fellows)
[j86] [j75] [j74] [c69] [c68] [i5] [c48]
21Henning Fernau
[j80] [c88] [c85] [c64] [i3]
22Jirí Fiala
[j13] [c7]
23Aleksei V. Fishkin
[j13] [c7]
24Paola Flocchini
[j88]
25Pierre Fraigniaud
[j88] [j78] [j63] [i18] [j51] [j39] [c28]
26Serge Gaspers
[j93] [c100] [j71] [i20] [j57] [j53] [j50] [c72] [c67] [i12] [i11] [j44] [c50] [c47] [c37] [c36]
27Frédéric Giroire
[c104]
28Petr A. Golovach
[j94] [i33] [i32] [i31] [i29] [j90] [j83] [j82] [c102] [c100] [c96] [j77] [j76] [j73] [j70] [j68] [j65] [j64] [j61] [i20] [j57] [j54] [j52] [c82] [c78] [c76] [j48] [c74] [c66] [c65] [c63] [c62] [c55] [c54] [c53] [c51] [i4] [j35] [c41] [j11] [c13] [j3] [c1]
29Fabrizio Grandoni
[j96] [j92] [c83] [j47] [j45] [j40] [c58] [r1] [c38] [c34] [j27] [j26] [c30] [c29]
30Gregory Gutin
[j75] [j56] [j46] [c75] [i14] [i7] [c45] [c43] [i2] [i1]
31Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)
[j24] [j23] [j15] [c23] [c20] [c15]
32Alexander Hall
[j76] [c53]
33Pinar Heggernes
[c103] [c90] [j55] [j34] [c40] [c35] [c31] [j21] [c16]
34Pim van 't Hof
[j97] [c61]
35Kjartan Høie
[j32]
36Bart M. P. Jansen
[c101] [i26]
37Alain Jean-Marie
[c104]
38Petteri Kaski
[j95] [e3]
39Eun Jung Kim 0002
[j56] [c75] [i14]
40Janne H. Korhonen
[i31]
41Arie M. C. A. Koster
[j84] [j79] [c39]
42Rastislav Kralovic (Rastislav Královic)
[j37]
43Jan Kratochvíl
[j77] [j66] [j52] [j48] [c54] [c52] [c41] [j33] [c11]
44Dieter Kratsch
[j96] [j84] [j79] [j77] [c90] [j57] [j53] [j48] [j47] [j45] [j41] [c58] [c50] [r1] [j34] [c41] [c39] [c38] [c35] [c34] [j27] [c31] [c30] [j20] [c25] [c18] [j12] [j6] [c6] [c2]
45Stefan Kratsch
[c109] [i19]
46Stephan Kreutzer
[j78] [j63] [i18]
47Michael Krivelevich
[j46] [i7] [c45] [c43] [i2] [i1]
48Gregory Kucherov
[c35]
49Erik Jan van Leeuwen
[j90] [c103] [c100] [j73] [c93] [i22] [i20]
50Mathieu Liedloff
[j77] [j53] [j48] [c50] [c41]
51Andrzej Lingas
[j7] [c5]
52Yang Liu 0002
[j42] [c42]
53Daniel Lokshtanov
[j96] [c108] [i34] [i30] [j92] [j87] [j86] [j83] [j80] [c105] [c99] [c98] [i28] [i25] [j74] [j72] [j66] [j62] [j61] [c92] [c91] [i23] [j54] [c89] [c85] [c83] [c82] [c81] [c80] [c78] [i17] [i16] [i15] [c73] [c71] [c69] [c68] [c65] [c64] [c62] [c60] [i13] [i9] [c52] [i5] [i3] [c48]
54Elena Losievskaja
[c69] [i5]
55Songjian Lu
[j42] [c42]
56Federico Mancini
[j66] [c52]
57Dániel Marx
[c107] [e4]
58Martín Matamala
[j18] [j16] [c8] [j4]
59Dorian Mazauric
[c104]
60Frédéric Mazoit
[j49] [c27]
61Rodica Mihai
[j55] [c40]
62Matús Mihalák
[j76] [c53]
63Neeldhara Misra
[c105] [i28] [c91] [i15]
64Matthias Mnich
[c85]
65Haiko Müller
[j20] [j12] [c2]
66Jesper Nederlof
[c102]
67Jaroslav Nesetril (Jarik Nesetril)
[j8] [c9]
68Nicolas Nisse
[j88] [c104] [j52] [j51] [c28]
69Jean-Christophe Novelli
[j6] [c6]
70Yota Otachi
[j90]
71Sang-il Oum
[j58]
72Charis Papadopoulos
[c90]
73Christophe Paul
[j71] [c72] [i12]
74Daniël Paulusma
[j97] [j94] [c66] [c61]
75Eelko Penninkx
[j59] [c73] [i13] [c32]
76Anthony Perez
[j71] [c72] [i12]
77Geevarghese Philip
[c94] [c91] [c88] [c85] [i15]
78Marcin Pilipczuk
[c109] [i19]
79Michal Pilipczuk
[c111] [c109] [i35] [i30] [c102] [c101] [i26] [i21] [i19]
80Pawel Pralat
[j82]
81Erich Prisner
[j18] [j4]
82Artem V. Pyatkin
[j44] [j40] [c36] [j26] [c29] [j14] [c12]
83Venkatesh Raman
[j87] [j72] [c92] [c89] [c80] [i17] [i16] [c71] [i9]
84B. V. Raghavendra Rao
[j87] [i9]
85Ivan Rapaport
[j18] [j16] [c8] [j4]
86Igor Razgon
[j44]
87Frances A. Rosamond
[j86] [j74] [c69] [c68] [i5] [c48]
88Nicola Santoro
[j88]
89Ignasi Sau (Ignasi Sau Valls)
[j91] [j60] [c86] [c77]
90Saket Saurabh
[j96] [j93] [c108] [i34] [j92] [j87] [j86] [j81] [j80] [c106] [c105] [c99] [c98] [i28] [i27] [i25] [j74] [j72] [j71] [j69] [j67] [j62] [c92] [c91] [i23] [j57] [j56] [j54] [j53] [c89] [c88] [c85] [c83] [c82] [c81] [c80] [i17] [i16] [i15] [j50] [j46] [c75] [c73] [c72] [c71] [c70] [c69] [c68] [c67] [c65] [c64] [c60] [i14] [i13] [i12] [i11] [i9] [c59] [c57] [c50] [i8] [i7] [i5] [i3] [c48] [c47] [c45] [c43] [i2] [i1] [c37]
91Alexey A. Stepanov
[j50] [j40] [c46] [j26] [c29]
92Karol Suchan
[c100] [i20] [j52]
93Stefan Szeider
[c100] [j74] [i20] [c48]
94Jan Arne Telle
[j66] [c52] [j21] [c16]
95Dimitrios M. Thilikos
[c108] [j91] [j88] [j85] [j84] [j79] [j78] [c99] [i25] [j68] [j67] [j65] [j63] [j60] [i18] [j58] [c86] [c81] [c77] [c76] [c74] [c73] [c63] [i13] [j43] [j39] [j38] [c59] [c49] [r2] [i4] [j36] [c44] [j31] [j30] [j29] [c39] [c33] [j25] [j24] [j23] [j17] [j15] [c26] [c24] [c23] [c20] [c19] [j10] [c17] [c15] [c14] [c3]
96Carsten Thomassen
[j74] [c48]
97Stéphan Thomassé
[j93] [j71] [c72] [c67] [i12] [i11]
98Ioan Todinca
[c95] [j49] [j41] [j25] [c27] [c25]
99Martin Vatshelle
[c100] [i20]
100Elias Vicari
[j76] [c53]
101Yngve Villanger
[c110] [c109] [j89] [j86] [j80] [c106] [c100] [c97] [i27] [c95] [c94] [c90] [i24] [i20] [i19] [c79] [c68] [c64] [i10] [j42] [j41] [c56] [i6] [i3] [c42]
102Peter Widmayer
[j76] [c53]
103Gerhard J. Woeginger
[j37] [j35] [j33] [j14] [c21] [c18] [c13] [j8] [c12] [c11] [c9]
104Anders Yeo
[j56] [c75] [i14]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Thu May 23 08:51:30 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page