The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jan Arne Telle" ( http://dblp.L3S.de/Authors/Jan_Arne_Telle )

URL (Homepage):  http://www.ii.uib.no/~telle/  Author page on DBLP  Author page in RDF  Community of Jan Arne Telle in ASPL-2

Publication years (Num. hits)
1990-1998 (18) 1999-2003 (18) 2004-2006 (16) 2007-2010 (18) 2011-2014 (18) 2015-2017 (18) 2018-2019 (12)
Publication types (Num. hits)
article(65) inproceedings(52) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 16 occurrences of 16 keywords

Results
Found 119 publication records. Showing 118 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jan Arne Telle, Yngve Villanger FPT algorithms for domination in sparse graphs and beyond. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle Mim-width III. Graph powers and generalized distance domination problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle, José Hernández-Orallo, Cèsar Ferri The teaching size: computable teachers and learners for universal languages. Search on Bibsonomy Machine Learning The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset Linear MIM-Width of Trees. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset Linear MIM-Width of Trees. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle Generalized distance domination problems and their complexity on graphs of bounded mim-width. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1José Hernández-Orallo, Jan Arne Telle Finite Biased Teaching with Infinite Concept Classes. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum matching width: New characterizations and a fast algorithm for dominating set. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle A width parameter useful for chordal and co-comparability graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle A note on the complexity of Feedback Vertex Set parameterized by mim-width. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle A Width Parameter Useful for Chordal and Co-comparability Graphs. Search on Bibsonomy WALCOM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-Width. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jan Kratochvíl, Jan Arne Telle, Marek Tesar Computational complexity of covering three-vertex multigraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle On Satisfiability Problems with a Linear Structure. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle Sim-width and induced minors. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle On Satisfiability Problems with a Linear Structure. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jaroslav Nesetril, Oriol Serra, Jan Arne Telle Preface. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle The graph formulation of the union-closed sets conjecture. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving #SAT and MAXSAT by Dynamic Programming. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum matching width: new characterizations and a fast algorithm for dominating set. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving MaxSAT and #SAT on structured CNF formulas. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-width. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Jan Kratochvíl, Jan Arne Telle, Marek Tesar Computational Complexity of Covering Three-Vertex Multigraphs. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle Between Treewidth and Clique-Width. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle Solving MaxSAT and #SAT on Structured CNF Formulas. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle Feedback vertex set on graphs of low clique-width. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle, Yngve Villanger Connecting Terminals and 2-Disjoint Connected Subgraphs Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Olaf Owe, Martin Steffen, Jan Arne Telle The 18th International Symposium on Fundamentals of Computation Theory. Search on Bibsonomy Inf. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle, Yngve Villanger Connecting Terminals and 2-Disjoint Connected Subgraphs. Search on Bibsonomy WG The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle Upper Bounds on Boolean-Width with Applications to Exact Algorithms. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel Meister 0001, Jan Arne Telle Chordal digraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle, Yngve Villanger FPT Algorithms for Domination in Biclique-Free Graphs. Search on Bibsonomy ESA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle Mike Fellows: Weaving the Web of Mathematics and Adventure. Search on Bibsonomy The Multivariate Algorithmic Revolution and Beyond The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Boolean-width of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini 0001, Jan Arne Telle On the complexity of reconstructing H-free graphs from their Star Systems. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Owe, Martin Steffen, Jan Arne Telle (eds.) Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings Search on Bibsonomy FCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle Finding Good Decompositions for Dynamic Programming on Dense Graphs. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle Recognizing digraphs of Kelly-width 2. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle On the Boolean-Width of a Graph: Structure and Applications. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Christophe Paul, Jan Arne Telle Branchwidth of chordal graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frederic Dorn, Jan Arne Telle Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Jan Arne Telle Edge-maximal graphs of branchwidth k: The k-branches. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle Interval Completion Is Fixed Parameter Tractable. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel Meister 0001, Jan Arne Telle Chordal Digraphs. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Feedback Vertex Set on Graphs of Low Cliquewidth. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Boolean-Width of Graphs. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle Locally constrained graph homomorphisms and equitable partitions. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Sloper, Jan Arne Telle An Overview of Techniques for Designing Parameterized Algorithms. Search on Bibsonomy Comput. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Daniel Meister 0001, Frances A. Rosamond, R. Sritharan, Jan Arne Telle Leaf Powers and Their Properties: Using the Trees. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini 0001, Jan Arne Telle On the Complexity of Reconstructing H -free Graphs from Their Star Systems. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle Characterization and Recognition of Digraphs of Bounded Kelly-width. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger Interval completion with few edges. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF FPT algorithm, edge completion, profile minimization, interval graphs, branching, physical mapping
1Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. Search on Bibsonomy Nord. J. Comput. The full citation details ... 2006 DBLP  BibTeX  RDF
1Christophe Paul, Andrzej Proskurowski, Jan Arne Telle Generation of Graphs with Bounded Branchwidth. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1David R. Wood, Jan Arne Telle Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Search on Bibsonomy Graph Drawing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Frederic Dorn, Jan Arne Telle Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Sloper, Jan Arne Telle Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Jan Arne Telle Edge-maximal graphs of branchwidth k. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Jan Arne Telle, Yngve Villanger Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Bandwidth, Chordal graph, Graph searching, Tree decomposition, Elimination tree
1Jan Arne Telle Tree-decompositions of small pathwidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Jan Arne Telle, Yngve Villanger Computing minimal triangulations in time O(nalpha log n) = o(n2.376). Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
1Christophe Paul, Jan Arne Telle New Tools and Simpler Algorithms for Branchwidth. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle Iterated colorings of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Jan Arne Telle Space-Efficient Construction Variants of Dynamic Programming. Search on Bibsonomy Nord. J. Comput. The full citation details ... 2004 DBLP  BibTeX  RDF
1Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle Finding k Disjoint Triangles in an Arbitrary Graph. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle Graph coloring on coarse grained multicomputers. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle Generalized H-coloring and H-covering of Trees. Search on Bibsonomy Nord. J. Comput. The full citation details ... 2003 DBLP  BibTeX  RDF
1Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle Multicoloring trees. Search on Bibsonomy Inf. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jens Gustedt, Jan Arne Telle A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. Search on Bibsonomy ICTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle PRO: A Model for Parallel Resource-Optimal Computation. Search on Bibsonomy HPCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle Generalized H-Coloring and H-Covering of Trees. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jens Gustedt, Ole A. Mæhle, Jan Arne Telle The Treewidth of Java Programs. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle Tree-decompositions of small pathwidth. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle A practical algorithm for making filled graphs minimal. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski Memory Requirements for Table Computations in Partial k-Tree Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle Independent Sets with Domination Constraints. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle Mod-2 Independence and Domination in Graphs. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Petter Kristiansen, Jan Arne Telle Generalized H-Coloring of Graphs. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle Graph Coloring on a Coarse Grained Multiprocessor. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andrzej Proskurowski, Jan Arne Telle Classes of graphs with restricted interval models. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 1999 DBLP  BibTeX  RDF
1Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle Mod-2 Independence and Domination in Graphs. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle Multi-coloring Trees. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 118 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license