The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Arne Telle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens Gustedt, Ole A. Mæhle, Jan Arne Telle
    The Treewidth of Java Programs. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:86-97 [Conf]
  2. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multi-coloring Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:271-280 [Conf]
  3. Christophe Paul, Jan Arne Telle
    New Tools and Simpler Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:379-390 [Conf]
  4. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:73-85 [Conf]
  5. David R. Wood, Jan Arne Telle
    Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:150-161 [Conf]
  6. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
    PRO: A Model for Parallel Resource-Optimal Computation. [Citation Graph (0, 0)][DBLP]
    HPCS, 2002, pp:106-113 [Conf]
  7. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:176-187 [Conf]
  8. Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle
    OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    ICPP (2), 1990, pp:88-92 [Conf]
  9. Virginia Mary Lo, Sanjay V. Rajopadhye, Samik Gupta, David Keldsen, Moataz A. Mohamed, Jan Arne Telle
    Mapping Divide-and-Conquer Algorithms to Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1990, pp:128-135 [Conf]
  10. Jens Gustedt, Jan Arne Telle
    A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:125-136 [Conf]
  11. Petter Kristiansen, Jan Arne Telle
    Generalized H-Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:456-466 [Conf]
  12. Christian Sloper, Jan Arne Telle
    Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:251-263 [Conf]
  13. Frederic Dorn, Jan Arne Telle
    Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:386-397 [Conf]
  14. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
    Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:340-351 [Conf]
  15. Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle
    Linear-Time Register Allocation for a Fixed Number of Registers. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:574-583 [Conf]
  16. Pinar Heggernes, Jan Arne Telle, Yngve Villanger
    Computing minimal triangulations in time O(nalpha log n) = o(n2.376). [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:907-916 [Conf]
  17. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
    Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:173-184 [Conf]
  18. Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
    Memory Requirements for Table Computations in Partial k-tree Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:222-233 [Conf]
  19. Monika Rauch Henzinger, Jan Arne Telle
    Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:16-27 [Conf]
  20. Jan Arne Telle, Andrzej Proskurowski
    Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:610-621 [Conf]
  21. Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
    Finding k Disjoint Triangles in an Arbitrary Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:235-244 [Conf]
  22. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
    Generalized H-Coloring and H-Covering of Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:198-210 [Conf]
  23. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
    Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:115-126 [Conf]
  24. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
    Graph Coloring on a Coarse Grained Multiprocessor. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:184-195 [Conf]
  25. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:101-109 [Conf]
  26. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:93-105 [Conf]
  27. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Complexity of Colored Graph Covers I. Colored Directed Multigraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:242-257 [Conf]
  28. Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
    Generation of Graphs with Bounded Branchwidth. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:205-216 [Conf]
  29. Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
    Memory Requirements for Table Computations in Partial k-Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:382-394 [Journal]
  30. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:73-87 [Journal]
  31. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
    Graph coloring on coarse grained multicomputers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:179-198 [Journal]
  32. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:39-54 [Journal]
  33. Jan Arne Telle
    Tree-decompositions of small pathwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:210-218 [Journal]
  34. Jan Arne Telle, Andrzej Proskurowski
    Efficient Sets in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:109-117 [Journal]
  35. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
    Iterated colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:81-108 [Journal]
  36. Andrzej Proskurowski, Jan Arne Telle
    Classes of graphs with restricted interval models. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:4, pp:167-176 [Journal]
  37. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multicoloring trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:113-129 [Journal]
  38. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:355-363 [Journal]
  39. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Covering Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:1-16 [Journal]
  40. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
    Generalized H-coloring and H-covering of Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:3, pp:206-223 [Journal]
  41. Hans L. Bodlaender, Jan Arne Telle
    Space-Efficient Construction Variants of Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:4, pp:374-385 [Journal]
  42. Pinar Heggernes, Jan Arne Telle
    Partitioning Graphs into Generalized Dominating Sets. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:128-142 [Journal]
  43. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    On the Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:3, pp:173-195 [Journal]
  44. Jan Arne Telle
    Complexity of Domination-Type Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:1, pp:157-171 [Journal]
  45. Pinar Heggernes, Jan Arne Telle, Yngve Villanger
    Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:900-913 [Journal]
  46. Jan Arne Telle, Andrzej Proskurowski
    Algorithms for Vertex Partitioning Problems on Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:4, pp:529-550 [Journal]
  47. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
    A practical algorithm for making filled graphs minimal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:125-141 [Journal]
  48. Virginia Mary Lo, Sanjay V. Rajopadhye, Jan Arne Telle, Xiaoxiong Zhong
    Parallel Divide and Conquer on Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:10, pp:1049-1058 [Journal]
  49. Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
    Interval completion with few edges. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:374-381 [Conf]

  50. Leaf Powers and Their Properties: Using the Trees. [Citation Graph (, )][DBLP]


  51. Boolean-Width of Graphs. [Citation Graph (, )][DBLP]


  52. On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP]


  53. Characterization and Recognition of Digraphs of Bounded Kelly-width. [Citation Graph (, )][DBLP]


  54. Chordal Digraphs. [Citation Graph (, )][DBLP]


  55. Feedback Vertex Set on Graphs of Low Cliquewidth. [Citation Graph (, )][DBLP]


  56. An Overview of Techniques for Designing Parameterized Algorithms. [Citation Graph (, )][DBLP]


  57. Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions [Citation Graph (, )][DBLP]


  58. Branchwidth of chordal graphs. [Citation Graph (, )][DBLP]


  59. Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. [Citation Graph (, )][DBLP]


  60. Recognizing digraphs of Kelly-width 2. [Citation Graph (, )][DBLP]


  61. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. [Citation Graph (, )][DBLP]


  62. Edge-maximal graphs of branchwidth k: The k-branches. [Citation Graph (, )][DBLP]


  63. Locally constrained graph homomorphisms and equitable partitions. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002