default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiulia Galbiati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j25]Giulia Galbiati, Stefano Gualandi
, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Discret. Appl. Math. 164: 112-120 (2014)- 2013
- [i1]Giulia Galbiati, Stefano Gualandi:
Coloring of paths into forests. CTW 2013: 113-116 - 2011
- [j24]Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi:
On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. 159(4): 187-200 (2011) - [j23]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours, and flows. Networks 57(3): 254-260 (2011) - [c9]Giulia Galbiati:
Approximating Minimum Cut with Bounded Size. INOC 2011: 210-215 - [c8]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Changeover Cost Arborescences. SEA 2011: 112-123 - 2010
- [j22]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Electron. Notes Discret. Math. 36: 81-88 (2010) - [j21]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. Networks 55(3): 247-255 (2010)
2000 – 2009
- 2008
- [j20]Giulia Galbiati:
The complexity of a minimum reload cost diameter problem. Discret. Appl. Math. 156(18): 3494-3497 (2008) - [c7]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours and flows. CTW 2008: 112-115 - 2007
- [j19]Giulia Galbiati, Francesco Maffioli:
Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385(1-3): 78-87 (2007) - 2006
- [j18]Giulia Galbiati, Francesco Maffioli:
Approximating Max Cut with Limited Unbalance. Electron. Notes Discret. Math. 25: 101-104 (2006) - [c6]Giulia Galbiati, Francesco Maffioli:
Approximating Maximum Cut with Limited Unbalance. WAOA 2006: 202-213 - 2003
- [j17]Giulia Galbiati:
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. Inf. Process. Lett. 88(4): 155-159 (2003) - [c5]Giulia Galbiati, Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA 2003: 151-164 - 2002
- [j16]Giulia Galbiati:
On the approximation of the Minimum Disturbance p-Facility Location Problem. Discret. Appl. Math. 118(1-2): 73-83 (2002) - 2001
- [j15]Giulia Galbiati:
On Optimum Cycle Bases. Electron. Notes Discret. Math. 10: 113-116 (2001) - [c4]Giulia Galbiati:
On Min-Max Cycle Bases. ISAAC 2001: 116-123 - 2000
- [j14]Francesco Maffioli, Giulia Galbiati:
Approximability of hard combinatorial optimization problems: an introduction. Ann. Oper. Res. 96(1-4): 221-236 (2000)
1990 – 1999
- 1999
- [j13]Giulia Galbiati, Francesco Maffioli, Carlo Viola:
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complex. 15(4): 537-556 (1999) - 1997
- [j12]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Approximability of Some Maximum Spanning Tree Problems. Theor. Comput. Sci. 181(1): 107-118 (1997) - 1996
- [c3]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Logical Definability of Some Maximum Leaves Problems. DMTCS 1996: 214-225 - 1995
- [c2]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Approximability of some Maximum Spanning Tree Problems. LATIN 1995: 300-310 - 1994
- [j11]Giulia Galbiati, Francesco Maffioli:
on the Computation of Pfaffians. Discret. Appl. Math. 51(3): 269-275 (1994) - [j10]Giulia Galbiati, Francesco Maffioli, Angelo Morzenti:
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Inf. Process. Lett. 52(1): 45-49 (1994) - 1993
- [j9]Giulia Galbiati, Francesco Maffioli:
Preface. Discret. Appl. Math. 42(2): 119 (1993) - 1992
- [j8]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13(2): 258-273 (1992) - [j7]Giulia Galbiati, Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2. Parallel Process. Lett. 2: 301-309 (1992) - 1991
- [j6]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
The image of weighted combinatorial problems. Ann. Oper. Res. 33(3): 181-197 (1991) - [j5]Giulia Galbiati:
A phrase-based matching function. J. Am. Soc. Inf. Sci. 42(1): 36-48 (1991) - 1990
- [j4]Giulia Galbiati:
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. J. Complex. 6(2): 149-165 (1990) - [c1]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO 1990: 101-113
1980 – 1989
- 1983
- [j3]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
On the complexity of finding multi-constrained spanning trees. Discret. Appl. Math. 5(1): 39-50 (1983) - 1982
- [j2]Alan M. Frieze, Giulia Galbiati, Francesco Maffioli:
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1): 23-39 (1982) - 1981
- [j1]Giulia Galbiati:
M. J. Fischer: On the Complexity of 2-Output Boolean Networks. Theor. Comput. Sci. 16: 177-185 (1981)
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-04-24 23:14 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:
