Samuel Fiorini

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nadia Hardy

> Home > Persons > Samuel Fiorini

Publications

2008
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/FioriniHRV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/FioriniHRV08
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Discret. Appl. Math. 156(7): 1175-1180 (2008)
2007
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/FioriniHRV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/FioriniHRV07
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007)
2005
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/FioriniHRV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/FioriniHRV05
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Electron. Notes Discret. Math. 19: 265-271 (2005)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/FioriniHRV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/FioriniHRV05
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50

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.