Paolo Giulio Franciosa

Vladimir Gurvich

Mikhail N. Vyalyi

Int. J. Game Theory, June, 2024

How vulnerable is an undirected planar graph with respect to max flow.

[BibT_eX]

[DOI]

Networks, April, 2024

Non-crossing shortest paths lengths in planar graphs in linear time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Max Flow Vulnerability of Undirected Planar Networks.

[BibT_eX]

[DOI]

Proceedings of the 32nd Symposium of Advanced Database Systems, 2024

2023

Evaluating homophily in networks via <i>HONTO</i> (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks.

[BibT_eX]

[DOI]

Daniel Blankenberg

Fabio Cumbo

Daniele Santoni

Bioinform., January, 2023

2022

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

A tight relation between series-parallel graphs and bipartite distance hereditary graphs.

[BibT_eX]

[DOI]

Massimiliano Caramia

Jean-François Mascari

Art Discret. Appl. Math., 2022

2021

On function homophily of microbial Protein-Protein Interaction Networks.

[BibT_eX]

[DOI]

Daniele Santoni

CoRR, 2021

Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Max-flow vitality in undirected unweighted planar graphs.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Max flow vitality in general and st-planar graphs.

[BibT_eX]

[DOI]

Networks, 2019

2018

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

2017

On computing the Galois lattice of bipartite distance hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Max flow vitality in general and planar graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

On Resilient Graph Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

On the Galois lattice of bipartite distance hereditary graphs.

[BibT_eX]

[DOI]

Massimiliano Caramia

Discret. Appl. Math., 2015

2013

On Robust Graph Spanners

[BibT_eX]

[DOI]

CoRR, 2013

2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

2009

Small stretch (alpha, beta)-spanners in the streaming model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the complexity of recognizing directed path families.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Graph Spanners in the Streaming Model: An Experimental Study.

[BibT_eX]

[DOI]

Camil Demetrescu

Algorithmica, 2009

2007

A characterization of partial directed line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Algorithms, 2007

2006

Small Stretch Spanners on Dynamic Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

2005

Partially dynamic maintenance of minimum weight hyperpaths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2005

2001

Semi-dynamic breadth-first search in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Efficient Searching with Linear Constraints.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Lars Arge

Jeff Erickson

Jeffrey Scott Vitter

J. Comput. Syst. Sci., 2000

1998

Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the Algorithms, 1998

1997

The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Giorgio Gambosi

Umberto Nanni

Inf. Process. Lett., 1997

Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Maintaining Maxima under Boundary Updates.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Enclosing a Set of Objects by Two Minimum Area Rectangles.

[BibT_eX]

[DOI]

Bruno Becker

J. Algorithms, 1996

1994

A convex hull algorithm for points with approximately known positions.

[BibT_eX]

[DOI]

Carlo Gaibisso

Giorgio Gambosi

Int. J. Comput. Geom. Appl., 1994

Orders, <i>k</i>-sets and Fast Halfplane Search on Paged Memory.

[BibT_eX]

[DOI]

Proceedings of the Orders, 1994

On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's.

[BibT_eX]

[DOI]

Giorgio Gambosi

Umberto Nanni

Proceedings of the Algorithms, 1994

1993

Separating sets of hyperrectangles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

ESPRIT Project EP6881 AMUSING.

[BibT_eX]

[DOI]

IEEE Data Eng. Bull., 1993

1992

On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Enclosing Many Boxes by an Optimal Pair of Boxes.

[BibT_eX]

[DOI]

Bruno Becker

Proceedings of the STACS 92, 1992

1991

An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles.

[BibT_eX]

[DOI]

Bruno Becker