The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pinar Heggernes: [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. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:161-171 [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. 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]
  6. Pinar Heggernes, Federico Mancini, Charis Papadopoulos
    Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:419-428 [Conf]
  7. Pinar Heggernes, Federico Mancini
    Minimal Split Completions of Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:592-604 [Conf]
  8. Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
    Optimal Linear Arrangement of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:267-279 [Conf]
  9. Pinar Heggernes, Yngve Villanger
    Simple and Efficient Modifications of Elimination Orderings. [Citation Graph (0, 0)][DBLP]
    PARA, 2004, pp:788-797 [Conf]
  10. 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]
  11. Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
    Characterizing Minimal Interval Completions. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:236-247 [Conf]
  12. Anne Berry, Jean Paul Bordat, Pinar Heggernes
    Recognizing Weakly Triangulated Graphs by Edge Separability. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:139-149 [Conf]
  13. 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]
  14. Anne Berry, Jean R. S. Blair, Pinar Heggernes
    Maximum Cardinality Search for Computing Minimal Triangulations. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:1-12 [Conf]
  15. Anne Berry, Pinar Heggernes, Geneviève Simonet
    The Minimum Degree Heuristic and the Minimal Triangulation Process. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:58-70 [Conf]
  16. 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]
  17. 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]
  18. Pinar Heggernes, Daniel Lokshtanov
    Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:187-198 [Conf]
  19. Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
    Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:4, pp:287-298 [Journal]
  20. 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]
  21. 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]
  22. Pinar Heggernes
    Minimal triangulations of graphs: A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:297-317 [Journal]
  23. Pinar Heggernes, Daniel Lokshtanov
    Optimal broadcast domination in polynomial time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3267-3280 [Journal]
  24. 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]
  25. 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]
  26. Anne Berry, Jean Paul Bordat, Pinar Heggernes
    Recognizing Weakly Triangulated Graphs by Edge Separability. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:164-177 [Journal]
  27. 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]
  28. 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]
  29. 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]
  30. Pinar Heggernes, Charis Papadopoulos
    Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:406-416 [Conf]
  31. 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]
  32. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:381-393 [Journal]

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


  34. Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. [Citation Graph (, )][DBLP]


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


  36. Bandwidth on AT-Free Graphs. [Citation Graph (, )][DBLP]


  37. Bandwidth of Bipartite Permutation Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  38. Clustering with Partial Information. [Citation Graph (, )][DBLP]


  39. Choosability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  40. Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. [Citation Graph (, )][DBLP]


  41. Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]


  42. Graphs of Linear Clique-Width at Most 3. [Citation Graph (, )][DBLP]


  43. A Complete Characterisation of the Linear Clique-Width of Path Powers. [Citation Graph (, )][DBLP]


  44. Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. [Citation Graph (, )][DBLP]


  45. Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. [Citation Graph (, )][DBLP]


  46. Mixed Search Number and Linear-Width of Interval and Split Graphs. [Citation Graph (, )][DBLP]


  47. Edge Search Number of Cographs in Linear Time. [Citation Graph (, )][DBLP]


  48. Mixed Search Number of Permutation Graphs. [Citation Graph (, )][DBLP]


  49. Polar Permutation Graphs. [Citation Graph (, )][DBLP]


  50. Minimal comparability completions of arbitrary graphs. [Citation Graph (, )][DBLP]


  51. Dynamically maintaining split graphs. [Citation Graph (, )][DBLP]


  52. Minimal split completions. [Citation Graph (, )][DBLP]


  53. Guest Editors' Foreword. [Citation Graph (, )][DBLP]


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