default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Galluccio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j26]Anna Galluccio, Claudio Gentile:
The stable set polytope of icosahedral graphs. Discret. Math. 339(2): 614-625 (2016)- 2015
- [j25]Nicola Apollonio, Anna Galluccio:
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths. SIAM J. Discret. Math. 29(4): 1837-1863 (2015) - 2014
- [j24]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect. J. Comb. Theory B 107: 92-122 (2014) - [j23]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect. J. Comb. Theory B 108: 1-28 (2014) - 2013
- [j22]Anna Galluccio, Claudio Gentile, Paolo Ventura:
22-clique-bond of stable set polyhedra. Discret. Appl. Math. 161(13-14): 1988-2000 (2013) - [j21]Caterina De Simone, Anna Galluccio:
Edge-colouring of joins of regular graphs II. J. Comb. Optim. 25(1): 78-90 (2013) - 2010
- [j20]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with large stability number. Electron. Notes Discret. Math. 36: 1025-1032 (2010) - 2009
- [j19]Caterina De Simone, Anna Galluccio:
Edge-colouring of joins of regular graphs, I. J. Comb. Optim. 18(4): 417-428 (2009) - [j18]Anna Galluccio, Claudio Gentile, Paolo Ventura:
Gear Composition of Stable Set Polytopes and G-Perfection. Math. Oper. Res. 34(4): 813-836 (2009) - 2008
- [j17]Anna Galluccio, Claudio Gentile, Paolo Ventura:
Gear composition and the stable set polytope. Oper. Res. Lett. 36(4): 419-423 (2008) - 2007
- [j16]Caterina De Simone, Anna Galluccio:
Edge-colouring of regular graphs of large degree. Theor. Comput. Sci. 389(1-2): 91-99 (2007) - 2006
- [j15]Anna Galluccio, Paolo Nobili
:
Improved approximation of maximum vertex cover. Oper. Res. Lett. 34(1): 77-84 (2006) - 2003
- [j14]Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica 36(4): 361-374 (2003) - 2002
- [j13]Anna Galluccio, Luis A. Goddyn:
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. Comb. 22(3): 455-459 (2002) - 2001
- [j12]Anna Galluccio, Luis A. Goddyn, Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite. J. Comb. Theory B 83(1): 1-14 (2001) - [j11]Anna Galluccio, Martin Loebl, Jan Vondrák:
Optimization via enumeration: a new algorithm for the Max Cut Problem. Math. Program. 90(2): 273-290 (2001) - 2000
- [j10]Anna Galluccio, Pavol Hell, Jaroslav Nesetril:
The complexity of H-colouring of bounded degree graphs. Discret. Math. 222(1-3): 101-109 (2000) - 1999
- [j9]Anna Galluccio, Martin Loebl:
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electron. J. Comb. 6 (1999) - [j8]Anna Galluccio, Martin Loebl:
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electron. J. Comb. 6 (1999) - 1998
- [j7]Anna Galluccio, Martin Loebl:
Even Directed Cycles in H-Free Digraphs. J. Algorithms 27(1): 26-41 (1998) - 1997
- [j6]Paola Bertolazzi, Caterina De Simone, Anna Galluccio:
A Nice Class for the Vertex Packing Problem. Discret. Appl. Math. 76(1-3): 3-19 (1997) - [j5]Anna Galluccio, Antonio Sassano:
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. J. Comb. Theory B 69(1): 1-38 (1997) - 1996
- [j4]Anna Galluccio, Martin Loebl:
Cycles of Prescribed Modularity in Planar Digraphs. J. Algorithms 21(1): 51-70 (1996) - [j3]Anna Galluccio, Martin Loebl:
(p, q)-odd digraphs. J. Graph Theory 23(2): 175-184 (1996) - 1994
- [j2]Caterina De Simone, Anna Galluccio:
New classes of Berge perfect graphs. Discret. Math. 131(1-3): 67-79 (1994) - [j1]Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi:
Different capacities of a digraph. Graphs Comb. 10(2-4): 105-121 (1994)
Conference and Workshop Papers
- 2011
- [c8]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number greater than three. OR 2011: 47-52 - 2009
- [c7]Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura:
The k-Gear Composition and the Stable Set Polytope. CTW 2009: 251-254 - 2008
- [c6]Anna Galluccio, Claudio Gentile, Paolo Ventura:
On the Stable Set Polytope of Claw-Free Graphs. COCOA 2008: 339-350 - [c5]Caterina De Simone, Anna Galluccio:
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs. COCOA 2008: 351-360 - 2004
- [c4]Michele Conforti, Anna Galluccio, Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices. WG 2004: 355-364 - 2002
- [c3]Anna Galluccio, Guido Proietti:
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. ISAAC 2002: 150-162 - 2001
- [c2]Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. ISAAC 2001: 345-354 - 1993
- [c1]Anna Galluccio, Martin Loebl:
Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127
Informal and Other Publications
- 2014
- [i1]Nicola Apollonio, Anna Galluccio:
Minimally unbalanced diamond-free graphs and Dyck-paths. CoRR abs/1406.6494 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
