Jan Arne Telle - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Boolean-width of graphsBinh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle. TCS, 412(39):5187-5204, 2011. [doi]

On the complexity of reconstructing ::::H::::-free graphs from their Star SystemsFedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle. jgt, 68(2):113-124, 2011. [doi]

Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. ProceedingsOlaf Owe, Martin Steffen, Jan Arne Telle, editors, Volume 6914 of Lecture Notes in Computer Science, Springer, 2011. [doi]

2010

2009

Boolean-Width of GraphsBinh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle. iwpec 2009: 61-74 [doi]

Feedback Vertex Set on Graphs of Low CliquewidthBinh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle. iwoca 2009: 113-124 [doi]

Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithmFrederic Dorn, Jan Arne Telle. DAM, 157(12):2737-2746, 2009. [doi]

Chordal DigraphsDaniel Meister, Jan Arne Telle. wg 2010: 273-284 [doi]

Branchwidth of chordal graphsChristophe Paul, Jan Arne Telle. DAM, 157(12):2718-2725, 2009. [doi]

Edge-maximal graphs of branchwidth k: The k-branchesChristophe Paul, Jan Arne Telle. DM, 309(6):1467-1475, 2009. [doi]

Interval Completion Is Fixed Parameter TractableYngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle. siamcomp, 38(5):2007-2020, 2009. [doi]

2008

2007

Interval completion with few edgesPinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger. stoc 2007: 374-381 [doi]

Characterization and Recognition of Digraphs of Bounded Kelly-widthDaniel Meister, Jan Arne Telle, Martin Vatshelle. criwg 2007: 270-279 [doi]

2006

2005

Matrix and Graph Orders Derived from Locally Constrained Graph HomomorphismsJirí Fiala, Daniël Paulusma, Jan Arne Telle. mfcs 2005: 340-351 [doi]

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph HomomorphismsJirí Fiala, Daniël Paulusma, Jan Arne Telle. criwg 2005: 115-126 [doi]

Computing minimal triangulations in time O(n:::alpha::: log n) = o(n:::2.376:::)Pinar Heggernes, Jan Arne Telle, Yngve Villanger. soda 2005: 907-916 [doi]

Computing Minimal Triangulations in Time ::::O::::(::::n:::::::alpha::: ::::log n::::) = ::::o::::(::::n:::: :::2.376:::)Pinar Heggernes, Jan Arne Telle, Yngve Villanger. siamdm, 19(4):900-913, 2005. [doi]

New Tools and Simpler Algorithms for BranchwidthChristophe Paul, Jan Arne Telle. esa 2005: 379-390 [doi]

Edge-maximal graphs of branchwidth kChristophe Paul, Jan Arne Telle. endm, 22:363-368, 2005. [doi]

Tree-decompositions of small pathwidthJan Arne Telle. DAM, 145(2):210-218, 2005. [doi]

2004

2003

2002

2001

A practical algorithm for making filled graphs minimalJean R. S. Blair, Pinar Heggernes, Jan Arne Telle. TCS, 250(1-2):125-141, 2001. [doi]

Tree-decompositions of small pathwidthJan Arne Telle. endm, 10:277-280, 2001. [doi]

2000

1999

1998

1997

Complexity of Colored Graph Covers I. Colored Directed MultigraphsJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle. criwg 1997: 242-257

Covering Regular GraphsJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle. JCT, 71(1):1-16, 1997. [doi]

Algorithms for Vertex Partitioning Problems on Partial ::::k::::-TreesJan Arne Telle, Andrzej Proskurowski. siamdm, 10(4):529-550, 1997. [doi]

1996

Making an Arbitrary Filled Graph Minimal by Removing Fill EdgesJean R. S. Blair, Pinar Heggernes, Jan Arne Telle. swat 1996: 173-184

Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol PruningMonika Rauch Henzinger, Jan Arne Telle. swat 1996: 16-27

Parallel Divide and Conquer on MeshesVirginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong. tpds, 7(10):1049-1058, 1996. [doi]

1994

Complexity of Graph Covering ProblemsJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle. criwg 1995: 93-105

Complexity of Domination-Type Problems in GraphsJan Arne Telle. njc, 1(1):157-171, 1994.

1993

Practical Algorithms on Partial k-Trees with an Application to Domination-like ProblemsJan Arne Telle, Andrzej Proskurowski. wads 1993: 610-621

Efficient Sets in Partial ::::k::::-TreesJan Arne Telle, Andrzej Proskurowski. DAM, 44(1-3):109-117, 1993. [doi]

1990

OREGAMI: Software Tools for Mapping Parallel Computations to Parallel ArchitecturesVirginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle. icpp 1990: 88-92

Mapping Divide-and-Conquer Algorithms to Parallel ArchitecturesVirginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle. icpp 1990: 128-135