| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rémy Belmonte, Pinar Heggernes, Pim van 't Hof |
Edge contractions in subclasses of chordal graphs.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest editors' foreword. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Rodica Mihai |
Edge search number of cographs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister |
Computing Minimum Geodetic Sets of Proper Interval Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch |
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul |
Contracting chordal graphs and bipartite graphs to paths and trees. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
Strongly chordal and chordal bipartite graphs are sandwich monotone. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
Graphs of linear clique-width at most 3. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-in. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs and Threshold Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell |
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Udi Rotics |
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Pinar Heggernes, Pim van 't Hof |
Edge Contractions in Subclasses of Chordal Graphs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
Enumerating Minimal Subset Feedback Vertex Sets. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister |
Hardness and approximation of minimum distortion embeddings. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with partial information. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
Mixed search number and linear-width of interval and split graphs. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest Editors' Foreword. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Udi Rotics |
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Yngve Villanger |
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniël Paulusma |
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
A Parameterized Algorithm for Chordal Sandwich. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
A new representation of proper interval graphs with an application to clique-width. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Charis Papadopoulos |
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini |
Minimal split completions. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini |
Dynamically maintaining split graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle |
Interval Completion Is Fixed Parameter Tractable. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
Bandwidth of bipartite permutation graphs in polynomial time. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Rodica Mihai |
Edge Search Number of Cographs in Linear Time. |
FAW |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
A Complete Characterisation of the Linear Clique-Width of Path Powers. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes |
Choosability of P5-Free Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-Free Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tinaz Ekim, Pinar Heggernes, Daniel Meister |
Polar Permutation Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet |
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos |
Minimal comparability completions of arbitrary graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Barry W. Peyton |
Fast Computation of Minimal Fill Inside A Given Elimination Ordering. |
SIAM J. Matrix Analysis Applications |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Rodica Mihai |
Mixed Search Number of Permutation Graphs. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
Graphs of Linear Clique-Width at Most 3. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-In. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch |
Linear-time certifying recognition algorithms and forbidden induced subgraphs. |
Nord. J. Comput. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
Mixed Search Number and Linear-Width of Interval and Split Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
Characterizing Minimal Interval Completions. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Charis Papadopoulos |
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
Interval completion with few edges. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
FPT algorithm, edge completion, profile minimization, interval graphs, branching, physical mapping |
| 1 | Federico Mancini, Pinar Heggernes |
A completely dynamic algorithm for split graphs. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov |
Optimal broadcast domination in polynomial time. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes |
Minimal triangulations of graphs: A survey. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Pinar Heggernes, Yngve Villanger |
A vertex incremental approach for maintaining chordality. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger |
A wide-range algorithm for minimal triangulation from an arbitrary ordering. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
Optimal Linear Arrangement of Interval Graphs. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini |
Minimal Split Completions of Graphs. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos |
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov |
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
Minimal Interval Completions. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
Computing minimal triangulations in time O(nalpha log n) = o(n2.376). |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Bandwidth, Chordal graph, Graph searching, Tree decomposition, Elimination tree |
| 1 | Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton |
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Minimal triangulations, Minimal elimination ordering, Minimal fill, Chordal graphs |
| 1 | Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle |
Finding k Disjoint Triangles in an Arbitrary Graph. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Yngve Villanger |
Simple and Efficient Modifications of Elimination Orderings. |
PARA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
Generalized H-coloring and H-covering of Trees. |
Nord. J. Comput. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Anne Berry, Pinar Heggernes, Geneviève Simonet |
The Minimum Degree Heuristic and the Minimal Triangulation Process. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Pinar Heggernes, Yngve Villanger |
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
Generalized H-Coloring and H-Covering of Trees. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Jean R. S. Blair, Pinar Heggernes |
Maximum Cardinality Search for Computing Minimal Triangulations. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Yngve Villanger |
Efficient Implementation of a Minimal Triangulation Algorithm. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle |
A practical algorithm for making filled graphs minimal. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Jean Paul Bordat, Pinar Heggernes |
Recognizing Weakly Triangulated Graphs by Edge Separability. |
Nord. J. Comput. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Anne Berry, Jean Paul Bordat, Pinar Heggernes |
Recognizing Weakly Triangulated Graphs by Edge Separability. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Arne Telle |
Partitioning Graphs into Generalized Dominating Sets. |
Nord. J. Comput. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle |
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")