Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Heggernes, Pinar
143  Ergebnisse:
Personensuche X
?
1

Generation of random chordal graphs using subtrees of a tre:

Şeker, Oylum ; Heggernes, Pinar ; Ekim, Tinaz.
RAIRO - Operations Research.  56 (2022)  2 - p. 565-582 , 2022
Link: https://doi.org/10.1051/..
 
?
2

On the Maximum Number of Edges in Chordal Graphs of Bounded..:

Blair, Jean R. S. ; Heggernes, Pinar ; Lima, Paloma T..
Algorithmica.  84 (2022)  12 - p. 3587-3602 , 2022
Link: https://doi.org/10.1007/..
 
?
3

Enumeration of minimal connected dominating sets for chorda..:

Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter.
Discrete Applied Mathematics.  278 (2020)  - p. 3-11 , 2020
Link: https://doi.org/10.1016/..
 
?
4

Finding connected secluded subgraphs:

Golovach, Petr A. ; Heggernes, Pinar ; Lima, Paloma T..
Journal of Computer and System Sciences.  113 (2020)  - p. 101-124 , 2020
Link: https://doi.org/10.1016/..
 
?
5

Parameterized Aspects of Strong Subgraph Closure:

Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L...
Algorithmica.  82 (2020)  7 - p. 2006-2038 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Partitioning a graph into degenerate subgraphs:

Abu-Khzam, Faisal N. ; Feghali, Carl ; Heggernes, Pinar
European Journal of Combinatorics.  83 (2020)  - p. 103015 , 2020
Link: https://doi.org/10.1016/..
 
?
7

On the Maximum Number of Edges in Chordal Graphs of Bounded..:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Blair, Jean R. S. ; Heggernes, Pinar ; Lima, Paloma T.. - p. 600-612 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Algorithms and Complexity: 11th International Conference, C.. 

Theoretical Computer Science and General Issues, 11485
Heggernes, Pinar - 1st ed. 2019 . , 2019
Link: https://doi.org/10.1007/..
 
?
9

Algorithms for Outerplanar Graph Roots and Graph Roots of P..:

Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter..
Algorithmica.  81 (2019)  7 - p. 2795-2828 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Enumeration and maximum number of minimal connected vertex ..:

Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter
European Journal of Combinatorics.  68 (2018)  - p. 132-147 , 2018
Link: https://doi.org/10.1016/..
 
?
11

On recognition of threshold tolerance graphs and their comp..:

Golovach, Petr A. ; Heggernes, Pinar ; Lindzey, Nathan...
Discrete Applied Mathematics.  216 (2017)  - p. 171-180 , 2017
Link: https://doi.org/10.1016/..
 
?
12

Definability equals recognizability for k-outerplanar graph..:

Jaffke, Lars ; Bodlaender, Hans L. ; Heggernes, Pinar.
European Journal of Combinatorics.  66 (2017)  - p. 191-234 , 2017
Link: https://doi.org/10.1016/..
 
?
13

Preface: Algorithmic Graph Theory on the Adriatic Coast:

Brešar, Boštjan ; Heggernes, Pinar ; Kamiński, Marcin...
Discrete Applied Mathematics.  231 (2017)  - p. 1-3 , 2017
Link: https://doi.org/10.1016/..
 
?
14

Output-Polynomial Enumeration on Graphs of Bounded (Local) ..:

Golovach, Petr A. ; Heggernes, Pinar ; Kanté, Mamadou Moustapha...
Algorithmica.  80 (2017)  2 - p. 714-741 , 2017
Link: https://doi.org/10.1007/..
 
?
15

Minimal dominating sets in interval graphs and trees:

Golovach, Petr A. ; Heggernes, Pinar ; Kanté, Mamadou Moustapha..
Discrete Applied Mathematics.  216 (2017)  - p. 162-170 , 2017
Link: https://doi.org/10.1016/..
 
1-15