The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yngve Villanger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
    Minimal Interval Completions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:403-414 [Conf]
  2. Pinar Heggernes, Yngve Villanger
    Efficient Implementation of a Minimal Triangulation Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:550-561 [Conf]
  3. Anne Berry, Pinar Heggernes, Yngve Villanger
    A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:47-57 [Conf]
  4. Yngve Villanger
    Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:800-811 [Conf]
  5. Pinar Heggernes, Yngve Villanger
    Simple and Efficient Modifications of Elimination Orderings. [Citation Graph (0, 0)][DBLP]
    PARA, 2004, pp:788-797 [Conf]
  6. 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]
  7. Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
    Characterizing Minimal Interval Completions. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:236-247 [Conf]
  8. Anne Berry, Pinar Heggernes, Yngve Villanger
    A vertex incremental approach for maintaining chordality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:318-336 [Journal]
  9. Yngve Villanger
    Lex M versus MCS-M. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:393-400 [Journal]
  10. Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
    A wide-range algorithm for minimal triangulation from an arbitrary ordering. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:1, pp:33-66 [Journal]
  11. 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]
  12. 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]
  13. Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger
    Improved Algorithms for the Feedback Vertex Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:422-433 [Conf]

  14. A Parameterized Algorithm for Chordal Sandwich. [Citation Graph (, )][DBLP]


  15. Treewidth Computation and Extremal Combinatorics. [Citation Graph (, )][DBLP]


  16. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]


  17. Faster Parameterized Algorithms for Minimum Fill-In. [Citation Graph (, )][DBLP]


  18. Capacitated Domination and Covering: A Parameterized Perspective. [Citation Graph (, )][DBLP]


  19. Computing Pathwidth Faster Than 2n. [Citation Graph (, )][DBLP]


  20. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]


  21. Finding Induced Subgraphs via Minimal Triangulations. [Citation Graph (, )][DBLP]


  22. Parameterized Complexity for Domination Problems on Degenerate Graphs. [Citation Graph (, )][DBLP]


  23. Treewidth computation and extremal combinatorics [Citation Graph (, )][DBLP]


  24. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves [Citation Graph (, )][DBLP]


  25. Finding Induced Subgraphs via Minimal Triangulations [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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