Treewidth

Results: 75



#Item
11Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:26:37
12Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 12:10:56
13Conference Programme 6-10 SeptemberConference Reception (Liverpool Anglican Cathedral) SUNDAY 5 September 2010, 18:30-20:00 ALGO 2010

Conference Programme 6-10 SeptemberConference Reception (Liverpool Anglican Cathedral) SUNDAY 5 September 2010, 18:30-20:00 ALGO 2010

Add to Reading List

Source URL: algo2010.csc.liv.ac.uk

Language: English - Date: 2010-09-02 11:57:06
14Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Add to Reading List

Source URL: www1.informatik.uni-wuerzburg.de

Language: English - Date: 2016-06-04 11:41:50
15Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U

Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-01-18 08:08:22
16An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2012-12-29 10:50:56
17Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:57:23
18Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY,

Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY,

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-09-29 04:25:56
19Intersection Graphs of L-Shapes and Segments in the Plane? Stefan Felsner1 , Kolja Knauer2 , George B. Mertzios3 , and Torsten Ueckerdt4 1 Institut f¨

Intersection Graphs of L-Shapes and Segments in the Plane? Stefan Felsner1 , Kolja Knauer2 , George B. Mertzios3 , and Torsten Ueckerdt4 1 Institut f¨

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2014-06-13 15:43:25