Varselmelding

There has not been added a translated version of this content. You can either try searching or go to the "area" home page to see if you can find the information there

Algorithms

Group publications

Unfortunately we are not able to keep this list updated. Please check the home page of every group member for recent publications.

Hovedinnhold

Other useful resources for searching for publications of our group members:

DBLP computer science bibliography

CRISTIN Current Research Information System In Norway

2018

Publications in 2018

2014

Publications in 2014

2013

Publications in 2013

2012

Publications in 2012

2011

Publications in 2011

2010

Publications in 2010

- Frederic Dorn, Hannes Moser, Rolf Niedermeier and Mathias Weller: Efficient Algorithms for Eulerian Extension. WG 2010: 100 - 111
- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)
- Fedor V. Fomin, Pinar Heggenes, and Rodica Mihai: Mixed search number and linear-width of interval and split graphs. Networks 56: 207-214 (2010).
- Pim van 't Hof, Gerhard Post, and Dirk Briskorn: Constructing fair round robin tournaments with a minimum number of breaks. Operation Research Letters 38: 592-596 (2010).
- Pim van 't Hof, Daniel Paulusma, and Johan M. M. van Rooij: Computing role assignments of chordal graphs. Theoretical Computer Science 411: 40-42 (2010).
- Ariful Azad, Johannes Langguth, Youhan Fang, Alan Qi, Alex Pothen: Identifying Rare Cell Populations in Comparative Flow Cytometry. WABI 2010: 162-175
- D. Bozdag, U. Catalyurek, A. Gebremedhin, F. Manne, E. Boman and F. Ozguner, Distributed-memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation, SIAM Journal on Scientific Computing Vol 32, Issue 4, pp 2418--2446, 2010.
- M. Patwary, R. Bisseling, and F. Manne, Parallel greedy graph matching using an edge partitioning approach. HLPP'10. ACM, pp 45-54.
- Jean R. S. Blair, Fredrik Manne, Rodica Mihai: Efficient Self-stabilizing Graph Searching in Tree Networks. SSS 2010: 111-125
- Johannes Langguth, Fredrik Manne, Peter Sanders: Heuristic initialization for bipartite matching problems. ACM Journal of Experimental Algorithmics 15: (2010)
- Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne: Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. SEA 2010: 411-423
- F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica.58(3): pages 790-810, 2010
- Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010
- Daniel Meister: Treewidth and minimum fill-in on permutation graphs in linear time. Theor. Comput. Sci. 411(40-42): 3685-3700 (2010)
- I.Adler, B-M Bui-Xuan, Y.Rabinovich, G.Renault, J.A.Telle and M.Vatshelle. On the boolean-width of a graph: structure and applications. Proceedings WG 2010, LNCS
- Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh: The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43
- Fedor V. Fomin: Kernelization. CSR 2010: 107-108
- Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109
- Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh: Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83
- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502
- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Bidimensionality and Kernels. SODA 2010: 503-510
- Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262
- Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394
- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. SWAT 2010: 273-284
- Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333
- 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)
- 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)
- 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)
- 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)
- Frederic Dorn: Planar Subgraph Isomorphism Revisited. STACS 2010: 263-274
- Frederic Dorn: Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discrete Applied Mathematics 158(7): 800-808 (2010)
- Thomas Erlebach, Erik Jan van Leeuwen: PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM 2010: 166-177
- Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle: Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185
- Hans L. Bodlaender, Mike Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, and Frances Rosamond. Clustering with partial information. Theoretical Computer Science 411: 1202-1211 (2010)
- Pinar Heggernes and Daniel Meister. Hardness and approximation of minimum distortion embeddings. Information processing letters 110: 312-316 (2010)
- Pinar Heggernes, Daniel Meister and Yngve Villanger. Induced subgraph isomorphism on interval and proper interval graphs. ISAAC 2010
- Pinar Heggernes, Pim van 't Hof and Daniel Paulusma. Computing role assignments of proper interval graphs in polynomial time. IWOCA 2010
- Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov and Jesper Nederlof. Computing the cutwidth of bipartite permutation graphs in linear time. WG 2010
- Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul and Jan Arne Telle. Generalized graph clustering: recognizing (p,q)-cluster graphs. WG 2010
- Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh. Fixed parameter algorithms for cochromatic number and disjoint rectangle stabbing. SWAT 2010: 334-345
- Pinar Heggernes, Daniel Meister, and Udi Rotics. Explotining linear structure to cope with the hardness of clique-width. TAMC 2010: 284-295
- Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger. A parameterized algorithm for chordal sandwich. CIAC 2010: 120-130
- Pinar Heggernes, Jan Kratochvil and Andrzej Proskurowski. Guest editors' foreword. Discrete Applied Mathematics 158: 729-730 (2010)
- Daniel Lokshtanov and Jesper Nederlof. Saving space by algebraization. STOC 2010: 321-330
- Jesper Nederlof and Johan M M van Rooij. Inclusion/exlusion branching for partial dominating set and set splitting. IPEC 2010
- G. Philip, Venkatesh Raman and Yngve Villanger. A quadratic kernel for pathwidth one vertex deletion. WG 2010
- Mathieu Liedloff, Ioan Todinca and Yngve Villanger. Solving capacitated dominating set by using covering by subsets and maximum matching. WG 2010
- Yngve Villanger. Proper interval vertex deletion. IPEC 2010
- Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh. Imbalance is fixed parameter tractable. COCOON 2010: 199-208
- Daniel Lokshtanov. Algorithmic lower bounds for problems on decomposable graphs. MFCS 2010: 37
- Daniel Lokshtanov, Federico Mancini and Charis Papadopoulos. Characterizing and computing minimal cograph completions. Discrete Applied Mathematics 158: 755-764 (2010)
- Daniel Lokshtanov. On the complexity of computing treelength. Discrete Applied Mathematics 158: 820-827 (2010)
- M. Fellows, B. Jansen, D. Lokshtanov, Fran Rosamond, Saket Saurabh. Determining the winner of a Dodgson election is hard. FSTTCS 2010

2009

Publications in 2009

2008

Publications in 2008

2007

Publications in 2007

2006

Publications in 2006

2005

Publications in 2005

2004

Publications in 2004

2003

Publications in 2003

2002

Publications in 2002

- P. Heggernes and Y. Villanger. Efficient Implementation of a Minimal Triangulation Algorithm. Proceedings ESA 2002 - 10th European Symposium on Algorithms, Rome, Italy, September 2002. Springer Verlag, Lecture Notes in Computer Science 2461, pages 550-561.
- A. Berry, J. R. S. Blair, and P. Heggernes. Maximum Cardinality Search for Computing Minimal Triangulations. Proceedings WG 2002 - 28th Workshop on Graph Theoretical Concepts in Computer Science, Cesky Krumlov, Czech Rebublic, June 2002. Springer Verlag, Lecture Notes in Computer Science 2573, pages 1-12.
- J. Fiala, P. Heggernes, P. Kristiansen, and J. A. Telle. Generalized H-coloring and H-covering of Trees. Proceedings WG 2002 - 28th Workshop on Graph Theoretical Concepts in Computer Science, Cesky Krumlov, Czech Rebublic, June 2002. Springer Verlag, Lecture Notes in Computer Science 2573, pages 198-210.
- H. Broersma, F. V. Fomin, J. Nesetril and G. J. Woeginger , More about subcoloring, Computing 69 (2002) 3, pp. 187-203.
- F. V. Fomin, D. Kratsch, and J. C. Novelli, Approximating minimum cocolourings, Inform. Process. Lett. 84 (2002), no. 5, pp. 285-290.
- H. L. Bodlaender and F. V. Fomin, Approximation of pathwidth of outerplanar graphs, J. of Algorithms, 43 (2002), pp. 190-200.
- F. V. Fomin and A. Lingas, Approximation algorithms for time-depending orienteering, Inform. Proc. Letters. 83 (2) (2002), pp. 57-62.
- H. L. Bodlaender, H. Broersma, F. V. Fomin, A. V. Pyatkin, and G. J. Woeginger , Radio labeling with pre-assigned frequencies , Proceedings of the 10th Annual European Symposium on Algorithms (ESA 2002), R. M\"ohring (Ed.): Springer-Verlag Lecture Notes in Computer Science, vol.\ 2461, 2002, pp. 211-222.
- H. Broersma, F. V. Fomin, J. Nesetril, and G. J. Woeginger , More about subcoloring , Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), L. Ku\v cera (Ed.): Springer-Verlag Lecture Notes in Computer Science, vol.\ 2573, 2002, pp. 68-79.
- F. V. Fomin, M. Matamala, and I. Rapaport , The complexity of approximating the oriented diameter of chordal graphs , Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), L. Ku\v cera (Ed.): Springer-Verlag Lecture Notes in Computer Science, vol.\ 2573, 2002, pp. 211-222.
- H. L. Bodlaender and F. V. Fomin , Tree decompositions with small cost, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), M. Penttonen, E. Meineche Schmidt (Eds.): Springer-Verlag Lecture Notes in Computer Science, vol.\ 2368, 2002, pp. 378-387.
- H. Broersma, F. V. Fomin, J. Kratochvil, and G. J. Woeginger , Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous , Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), M. Penttonen, E. Meineche Schmidt (Eds.): Springer-Verlag Lecture Notes in Computer Science, vol.\ 2368, 2002, pp. 160-169.
- A.Gebremedhin, I.Guerrin, J.Gustedt and J.A.Telle, PRO: A model for Parallel Resource-Optimal computation, Proceedings HPCS'2002 - The 16th Annual International Symposium on High Performance Computing Systems and Applications, IEEE, Moncton, NB, Canada, June 17-19, 2002.
- J.Gustedt, O.Mæhle and J.A.Telle , The treewidth of Java programs, Proceedings ALENEX'02- 4th Workshop on Algorithm Engineering and Experiments, San Francisco, January 4-5, 2002, Springer Verlag, Lecture Notes in Computer Science vol 2409.
- A.H.Gebremedhin, F.Manne, and A.Pothen, Parallel Distance-k Coloring Algorithms for Numerical Optimization, Proceedings Euro-Par 2002 - Paderborn, Germany, August 27-30, 2002, Springer Verlag, Lecture Notes in Computer Science vol 2400, pp. 912-921.

before 2002

31.07.2018