Pinar Heggernes

	2012
93		Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen: Making Life Easier for Firefighters. FUN 2012: 177-188
92		Tinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister: Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290
91		Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch: Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213
90		Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest editors' foreword. Discrete Applied Mathematics 160(6): 683-684 (2012)
89		Petr A. Golovach, Pinar Heggernes, Rodica Mihai: Edge search number of cographs. Discrete Applied Mathematics 160(6): 734-743 (2012)
88		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discrete Applied Mathematics 160(6): 888-901 (2012)
87		Rémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge contractions in subclasses of chordal graphs. Discrete Applied Mathematics 160(7-8): 999-1010 (2012)
	2011
86		Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342
85		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: 233-246
84		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: 240-251
83		Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228
82		Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees. IPEC 2011: 55-66
81		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: 110-119
80		Rémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539
79		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger: Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410
78		Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011)
77		Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges CoRR abs/1102.5441: (2011)
76		Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees CoRR abs/1104.3677: (2011)
75		Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell: Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1(5): 29-46 (2011)
74		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 37: 87-92 (2011)
73		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011)
72		Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discrete Math. 25(3): 1418-1437 (2011)
71		Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412(12-14): 1275-1297 (2011)
70		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412(39): 5466-5486 (2011)
69		Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011)
	2010
68		Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger: A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130
67		Pinar Heggernes, Daniel Meister, Yngve Villanger: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409
66		Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180
65		Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh: Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT 2010: 334-345
64		Pinar Heggernes, Daniel Meister, Udi Rotics: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295
63		Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle: Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183
62		Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87
61		Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest Editors' Foreword. Discrete Applied Mathematics 158(7): 729-730 (2010)
60		Pinar Heggernes, Daniel Meister: Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. 110(8-9): 312-316 (2010)
59		Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010)
58		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010)
	2009
57		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407
56		Pinar Heggernes, Rodica Mihai: Edge Search Number of Cographs in Linear Time. FAW 2009: 16-26
55		Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582
54		Tinaz Ekim, Pinar Heggernes, Daniel Meister: Polar Permutation Graphs. IWOCA 2009: 218-229
53		Petr A. Golovach, Pinar Heggernes: Choosability of P5-Free Graphs. MFCS 2009: 382-391
52		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250
51		Pinar Heggernes, Federico Mancini: Minimal split completions. Discrete Applied Mathematics 157(12): 2659-2669 (2009)
50		Pinar Heggernes, Federico Mancini: Dynamically maintaining split graphs. Discrete Applied Mathematics 157(9): 2057-2069 (2009)
49		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics 32: 27-34 (2009)
48		Pinar Heggernes, Dieter Kratsch, Daniel Meister: Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7(4): 533-544 (2009)
47		Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009)
46		Pinar Heggernes, Charis Papadopoulos: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410(1): 1-15 (2009)
	2008
45		Pinar Heggernes, Rodica Mihai: Mixed Search Number of Permutation Graphs. FAW 2008: 196-207
44		Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293
43		Pinar Heggernes, Dieter Kratsch, Daniel Meister: Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227
42		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
41		Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342
40		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341
39		Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229
38		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Minimal comparability completions of arbitrary graphs. Discrete Applied Mathematics 156(5): 705-718 (2008)
37		Pinar Heggernes, Barry W. Peyton: Fast Computation of Minimal Fill Inside A Given Elimination Ordering. SIAM J. Matrix Analysis Applications 30(4): 1424-1444 (2008)
36		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. 409(3): 601-616 (2008)
	2007
35		Pinar Heggernes, Charis Papadopoulos: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON 2007: 406-416
34		Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Characterizing Minimal Interval Completions. STACS 2007: 236-247
33		Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381
32		Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315
31		Pinar Heggernes, Dieter Kratsch: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1-2): 87-108 (2007)
30		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007)
	2006
29		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428
28		Pinar Heggernes, Federico Mancini: Minimal Split Completions of Graphs. LATIN 2006: 592-604
27		Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279
26		Pinar Heggernes, Daniel Lokshtanov: Optimal broadcast domination in polynomial time. Discrete Mathematics 306(24): 3267-3280 (2006)
25		Pinar Heggernes: Minimal triangulations of graphs: A survey. Discrete Mathematics 306(3): 297-317 (2006)
24		Anne Berry, Pinar Heggernes, Yngve Villanger: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306(3): 318-336 (2006)
23		Federico Mancini, Pinar Heggernes: A completely dynamic algorithm for split graphs. Electronic Notes in Discrete Mathematics 27: 69-70 (2006)
22		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 58(1): 33-66 (2006)
	2005
21		Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Minimal Interval Completions. ESA 2005: 403-414
20		Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171
19		Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916
18		Pinar Heggernes, Daniel Lokshtanov: Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG 2005: 187-198
17		Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discrete Math. 19(4): 900-913 (2005)
	2004
16		Pinar Heggernes, Yngve Villanger: Simple and Efficient Modifications of Elimination Orderings. PARA 2004: 788-797
15		Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244
14		Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton: Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004)
13		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2004)
	2003
12		Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle: Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85
11		Anne Berry, Pinar Heggernes, Yngve Villanger: A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57
10		Anne Berry, Pinar Heggernes, Geneviève Simonet: The Minimum Degree Heuristic and the Minimal Triangulation Process. WG 2003: 58-70
9		Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10(3): 206-223 (2003)
	2002
8		Pinar Heggernes, Yngve Villanger: Efficient Implementation of a Minimal Triangulation Algorithm. ESA 2002: 550-561
7		Anne Berry, Jean R. S. Blair, Pinar Heggernes: Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12
6		Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210
	2001
5		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001)
	2000
4		Anne Berry, Jean Paul Bordat, Pinar Heggernes: Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT 2000: 139-149
3		Anne Berry, Jean Paul Bordat, Pinar Heggernes: Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. 7(3): 164-177 (2000)
	1998
2		Pinar Heggernes, Jan Arne Telle: Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. 5(2): 128-142 (1998)
	1996
1		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184

Coauthor Index

1	Rémy Belmonte	[80] [81] [87]
2	Anne Berry	[3] [4] [7] [10] [11] [14] [22] [24] [36]
3	Jean R. S. Blair	[1] [5] [7] [14]
4	Hans L. Bodlaender	[42] [44] [58] [78]
5	Jean Paul Bordat	[3] [4] [22]
6	Andreas Brandstädt	[75]
7	Binh-Minh Bui-Xuan (Bùi Xuân Bình Minh)	[86]
8	Johanne Cohen	[27]
9	Jean-François Couturier	[91]
10	Elias Dahlhaus	[36]
11	Tinaz Ekim	[54] [92]
12	Aysel Erey	[92]
13	Michael R. Fellows (Mike Fellows)	[15] [42] [58]
14	Jirí Fiala	[6] [9]
15	Fedor V. Fomin	[12] [13] [20] [27] [30] [32] [59] [79] [93]
16	Petr A. Golovach	[53] [55] [69] [81] [89]
17	Martin Charles Golumbic	[75]
18	Pim van 't Hof	[62] [66] [74] [76] [77] [80] [81] [82] [83] [84] [87] [91] [92]
19	Bart M. P. Jansen	[84]
20	Marcin Jakub Kaminski (Marcin Kaminski)	[81]
21	Jan Kratochvíl	[61] [90]
22	Dieter Kratsch	[20] [27] [30] [31] [43] [48] [55] [65] [69] [79] [91]
23	Stefan Kratsch	[84]
24	Petter Kristiansen	[6] [9]
25	Gregory Kucherov	[27]
26	Erik Jan van Leeuwen	[93]
27	Benjamin Lévêque	[74] [76] [82]
28	Daniel Lokshtanov	[18] [26] [39] [55] [62] [63] [65] [69] [72] [76] [77] [82] [83]
29	Federico Mancini	[23] [28] [29] [38] [42] [50] [51] [57] [58] [68] [73]
30	Ross M. McConnell	[75]
31	Daniel Meister	[40] [41] [43] [48] [49] [52] [54] [55] [60] [64] [67] [69] [70] [71] [85] [86] [88] [92]
32	Rodica Mihai	[32] [39] [45] [56] [59] [72] [89]
33	Jesper Nederlof	[62] [63] [68]
34	Charis Papadopoulos	[29] [35] [38] [39] [40] [42] [46] [49] [52] [57] [58] [70] [72] [73] [79] [88]
35	Christophe Paul	[33] [47] [63] [74] [76] [77] [82] [83]
36	Daniël Paulusma	[66] [81]
37	Barry W. Peyton	[14] [37]
38	Andrzej Proskurowski	[41] [61] [71] [86] [90]
39	Venkatesh Raman	[65]
40	Frances A. Rosamond	[15] [42] [58]
41	Udi Rotics	[64] [85]
42	Saket Saurabh	[55] [65] [69]
43	Geneviève Simonet	[10] [22] [36]
44	Christian Sloper	[15]
45	R. Sritharan	[57] [73]
46	Karol Suchan	[21] [34]
47	Jan Arne Telle	[1] [2] [5] [6] [9] [12] [13] [15] [17] [19] [33] [47] [63]
48	Ioan Todinca	[21] [34]
49	Yngve Villanger	[8] [11] [16] [17] [19] [21] [22] [24] [33] [34] [44] [47] [67] [68] [78] [79] [84]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page