The SCEAS System
| |||||||

## Search the dblp DataBase
Pinar Heggernes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
**Minimal Interval Completions.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:403-414 [Conf] - Pinar Heggernes, Yngve Villanger
**Efficient Implementation of a Minimal Triangulation Algorithm.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:550-561 [Conf] - Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
**Exact Algorithms for Graph Homomorphisms.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:161-171 [Conf] - 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] - 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] - 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] - Pinar Heggernes, Federico Mancini
**Minimal Split Completions of Graphs.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:592-604 [Conf] - 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] - Pinar Heggernes, Yngve Villanger
**Simple and Efficient Modifications of Elimination Orderings.**[Citation Graph (0, 0)][DBLP] PARA, 2004, pp:788-797 [Conf] - Pinar Heggernes, Jan Arne Telle, Yngve Villanger
**Computing minimal triangulations in time O(n**[Citation Graph (0, 0)][DBLP]^{alpha}log n) = o(n^{2.376}). SODA, 2005, pp:907-916 [Conf] - Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
**Characterizing Minimal Interval Completions.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:236-247 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - Pinar Heggernes, Daniel Lokshtanov
**Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:187-198 [Conf] - 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] - 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] - 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] - Pinar Heggernes
**Minimal triangulations of graphs: A survey.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:3, pp:297-317 [Journal] - 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] - 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] - 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] - 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] - 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] - Pinar Heggernes, Jan Arne Telle, Yngve Villanger
**Computing Minimal Triangulations in Time**[Citation Graph (0, 0)][DBLP]*O*(*n*^{alpha}*log n*) =*o*(*n*^{2.376}). SIAM J. Discrete Math., 2005, v:19, n:4, pp:900-913 [Journal] - 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] - 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] - 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] - 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] **A Parameterized Algorithm for Chordal Sandwich.**[Citation Graph (, )][DBLP]**Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.**[Citation Graph (, )][DBLP]**Faster Parameterized Algorithms for Minimum Fill-In.**[Citation Graph (, )][DBLP]**Bandwidth on AT-Free Graphs.**[Citation Graph (, )][DBLP]**Bandwidth of Bipartite Permutation Graphs in Polynomial Time.**[Citation Graph (, )][DBLP]**Clustering with Partial Information.**[Citation Graph (, )][DBLP]**Choosability of P5-Free Graphs.**[Citation Graph (, )][DBLP]**Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.**[Citation Graph (, )][DBLP]**Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.**[Citation Graph (, )][DBLP]**Graphs of Linear Clique-Width at Most 3.**[Citation Graph (, )][DBLP]**A Complete Characterisation of the Linear Clique-Width of Path Powers.**[Citation Graph (, )][DBLP]**Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.**[Citation Graph (, )][DBLP]**Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.**[Citation Graph (, )][DBLP]**Mixed Search Number and Linear-Width of Interval and Split Graphs.**[Citation Graph (, )][DBLP]**Edge Search Number of Cographs in Linear Time.**[Citation Graph (, )][DBLP]**Mixed Search Number of Permutation Graphs.**[Citation Graph (, )][DBLP]**Polar Permutation Graphs.**[Citation Graph (, )][DBLP]**Minimal comparability completions of arbitrary graphs.**[Citation Graph (, )][DBLP]**Dynamically maintaining split graphs.**[Citation Graph (, )][DBLP]**Minimal split completions.**[Citation Graph (, )][DBLP]**Guest Editors' Foreword.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |