Jan Arne Telle

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Andrzej Proskurowski

> Home > Persons > Jan Arne Telle

Publications

2006
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/PaulPT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/PaulPT06
Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216
2003
[j16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/HalldorssonKPSST03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HalldorssonKPSST03
Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003)
2000
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AspvallTP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AspvallTP00
Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski:
Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
1999
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmtcs/ProskurowskiT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/ProskurowskiT99
Andrzej Proskurowski, Jan Arne Telle:
Classes of graphs with restricted interval models. Discret. Math. Theor. Comput. Sci. 3(4): 167-176 (1999)
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/HalldorssonKPSST99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/HalldorssonKPSST99
Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multi-coloring Trees. COCOON 1999: 271-280
1998
[j7]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/njc/KratochvilPT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/njc/KratochvilPT98
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/AspvallPT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/AspvallPT98
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle:
Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233
1997
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/KratochvilPT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/KratochvilPT97
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Covering Regular Graphs. J. Comb. Theory B 71(1): 1-16 (1997)
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/TelleP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/TelleP97
Jan Arne Telle, Andrzej Proskurowski:
Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discret. Math. 10(4): 529-550 (1997)
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/KratochvilPT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/KratochvilPT97
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257
1994
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/KratochvilPT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/KratochvilPT94
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Graph Covering Problems. WG 1994: 93-105
1993
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/TelleP93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/TelleP93
Jan Arne Telle, Andrzej Proskurowski:
Efficient Sets in Partial k-Trees. Discret. Appl. Math. 44(1-3): 109-117 (1993)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/TelleP93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/TelleP93
Jan Arne Telle, Andrzej Proskurowski:
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. WADS 1993: 610-621

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.