io-port.net

io-port 06113524 Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

Parameterizing by the number of numbers. (English)

Theory Comput. Syst. 50, No. 4, 675-693 (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109457 Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.

Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. (English)

Algorithmica 64, No. 1, 3-18 (2012).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06076953 Bell, Tim; Rosamond, Frances; Casey, Nancy

Computer science unplugged and related projects in math and computer science popularization. (English)

Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 398-456 (2012).

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06076943 Rosamond, Frances

Passion plays: melodramas about mathematics. (English)

Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 80-87 (2012).

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06070185 Brueggeman, Leo; Fellows, Michael; Fleischer, Rudolf; Lackner, Martin; Komusiewicz, Christian; Koutis, Yiannis; Pfandler, Andreas; Rosamond, Frances

Train marshalling is fixed parameter tractable. (English)

Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 51-56 (2012).

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06067700 Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve

Local search: is brute-force avoidable? (English)

J. Comput. Syst. Sci. 78, No. 3, 707-719 (2012).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06028428 Dom, Michael; Fellows, Michael R.; Rosamond, Frances A.; Sikdar, Somnath

The parameterized complexity of stabbing rectangles. (English)

Algorithmica 62, No. 1-2, 564-594 (2012).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06075074 Crowston, Robert; Fellows, Michael; Gutin, Gregory; Jones, Mark; Rosamond, Frances; Thomassé, Stéphan; Yeo, Anders

Simultaneously satisfying linear equations over $\mathbb {F}_2$: MaxLin2 and Max-$r$-Lin2 parameterized above average. (English)

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 229-240, electronic only (2011).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05948543 Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark

Quadratic kernelization for convex recoloring of trees. (English)

Algorithmica 61, No. 2, 362-388 (2011).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05892638 Rosamond, Frances A.; Bardohl, Roswitha; Diehl, Stephan; Geisler, Uwe; Bolduan, Gordon; Lessmöllmann, Annette; Schwill, Andreas; Stege, Ulrike

Reaching out to the media: become a computer science ambassador. (English)

Commun. ACM 54, No. 3, 113-116 (2011).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05853775 Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten

On the complexity of some colorful problems parameterized by treewidth. (English)

Inf. Comput. 209, No. 2, 143-153 (2011).

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 50297944 Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances A.; Rozenberg, Liat

Haplotype inference constrained by plausible haplotype data (English)

IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 6, 1692-1699 (2011).

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70125893 Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A.

Constraint satisfaction problems: convexity makes alldifferent constraints tractable (English)

IJCAI, 522-527 (2011).

13

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70960937 Crowston, Robert; Fellows, Michael R.; Gutin, Gregory; Jones, Mark; Rosamond, Frances A.; Thomassé, Stéphan; Yeo, Anders

Simultaneously satisfying linear equations over F\_2: maxlin2 and Max-r-lin2 parameterized above average (English)

FSTTCS, 229-240 (2011).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06073554 Fellows, Michael; Jansen, Bart M.P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket

Determining the winner of a Dodgson election is hard. (English)

Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 459-468, electronic only (2010).

15

PDF XML AMS-TeX TEXT BIBTeX DOI URL

io-port 05823285 Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

Parameterizing by the number of numbers. (English)

Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 123-134 (2010).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05816313 Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan

Milling a graph with turn costs: A parameterized complexity perspective. (English)

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28‒30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 123-134 (2010).

17

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05706005 Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances

W-hierarchies defined by symmetric gates. (English)

Theory Comput. Syst. 46, No. 2, 311-339 (2010).

18

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05678879 Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances

Clustering with partial information. (English)

Theor. Comput. Sci. 411, No. 7-9, 1202-1211 (2010).

19

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70060251 Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances A.; Whitesides, Sue; Yu, Nathan

Milling a graph with turn costs: A parameterized complexity perspective (English)

WG, 123-134 (2010).

20

PDF XML AMS-TeX TEXT BIBTeX DOI