×

Di Stefano, Gabriele

Author ID: di-stefano.gabriele Recent zbMATH articles by "Di Stefano, Gabriele"
Published as: Di Stefano, Gabriele; di Stefano, Gabriele

Publications by Year

Citations contained in zbMATH Open

68 Publications have been cited 384 times in 163 Documents Cited by Year
Gathering on rings under the look-compute-move model. Zbl 1320.68046
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
25
2014
Gathering of robots on anonymous grids and trees without multiplicity detection. Zbl 1332.68167
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Klasing, Ralf; Navarra, Alfredo
23
2016
Recoverable robustness in shunting and timetabling. Zbl 1266.90036
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo; Schachtebeck, Michael; Schöbel, Anita
15
2009
Gathering six oblivious robots on anonymous symmetric rings. Zbl 1298.68270
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
15
2014
Gathering of oblivious robots on infinite grids with minimum traveled distance. Zbl 1370.68286
Di Stefano, Gabriele; Navarra, Alfredo
14
2017
A graph theoretical approach to the shunting problem. Zbl 1271.90012
Di Stefano, Gabriele; Koči, Magnus Love
14
2004
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Zbl 1419.68184
Di Stefano, Gabriele; Navarra, Alfredo
13
2017
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. Zbl 1356.68016
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
13
2013
Graph classes between parity and distance-hereditary graphs. Zbl 0933.05144
Cicerone, Serafino; Di Stefano, Gabriele
10
1999
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Zbl 1425.68413
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
10
2018
Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Zbl 1432.68024
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
10
2019
Track assignment. Zbl 1122.90085
Cornelsen, Sabine; Di Stefano, Gabriele
9
2007
Dynamic multi-level overlay graphs for shortest paths. Zbl 1158.68053
Bruera, Francesco; Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele
9
2008
Computing on rings by oblivious robots: a unified approach for different tasks. Zbl 1319.68025
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Nisse, Nicolas; Suchan, Karol
9
2015
On the extension of bipartite to parity graphs. Zbl 0933.05132
Cicerone, Serafino; Di Stefano, Gabriele
8
1999
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. Zbl 1176.90203
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
8
2009
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies. Zbl 07176656
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
8
2019
How to gather asynchronous oblivious robots on anonymous rings. Zbl 1377.68035
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
8
2012
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Zbl 1407.68531
D’Emidio, Mattia; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
8
2018
Compact-port routing models and applications to distance-hereditary graphs. Zbl 0999.68015
Cicerone, Serafino; Di Stefano, Gabriele; Flammini, Michele
7
2001
Optimal gathering of oblivious robots in anonymous graphs. Zbl 1406.68109
Di Stefano, Gabriele; Navarra, Alfredo
7
2013
Graphs with bounded induced distance. Zbl 0965.05040
Cicerone, Serafino; Di Stefano, Gabriele
6
2001
Mutual visibility in graphs. Zbl 1510.05054
Di Stefano, Gabriele
6
2022
Embedded pattern formation by asynchronous robots without chirality. Zbl 1432.68025
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
6
2019
(\(k,+\))-distance-hereditary graphs. Zbl 1074.68042
Cicerone, Serafino; Di Stefano, Gabriele
5
2003
Minmax-distance gathering on given meeting points. Zbl 1459.68211
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
5
2015
About ungatherability of oblivious and asynchronous robots on anonymous rings. Zbl 1474.68381
Di Stefano, Gabriele; Montanari, Pietro; Navarra, Alfredo
5
2016
A fully dynamic algorithm for distributed shortest paths. Zbl 1044.68165
Cicerone, Serafino; Di Stefano, Gabriele; Frigioni, Daniele; Nanni, Umberto
5
2003
Distance-hereditary comparability graphs. Zbl 1254.05155
Di Stefano, Gabriele
5
2012
Networks with small stretch number. Zbl 1118.68583
Cicerone, Serafino; Di Stefano, Gabriele
4
2004
Dynamic algorithms for recoverable robustness problems. Zbl 1247.90038
Cicerone, Serafino; Di Stefano, Gabriele; Schachtebeck, Michael; Schöbel, Anita
4
2008
Robust algorithms and price of robustness in shunting problems. Zbl 1247.90037
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
4
2007
On the online track assignment problem. Zbl 1238.90088
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin
4
2012
Recoverable robust timetables: an algorithmic approach on trees. Zbl 1368.68120
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Pinotti, Cristina M.
4
2011
Minimizing the maximum duty for connectivity in multi-interface networks. Zbl 1311.90022
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
4
2010
Asynchronous embedded pattern formation without orientation. Zbl 1393.68183
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
4
2016
On the mutual visibility in Cartesian products and triangle-free graphs. Zbl 1510.05251
Cicerone, Serafino; Di Stefano, Gabriele; Klavžar, Sandi
4
2023
Bandwidth constrained multi-interface networks. Zbl 1298.68200
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
3
2011
Treelike comparability graphs. Zbl 1204.05037
Cornelsen, Sabine; di Stefano, Gabriele
3
2009
Partially dynamic efficient algorithms for distributed shortest paths. Zbl 1187.68699
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele
3
2010
Survivable networks with bounded delay: The edge failure case. (Extended abstract). Zbl 0964.68110
Cicerone, Serafino; Di Stefano, Gabriele; Handke, Dagmar
3
1999
Graphs with bounded induced distance. Zbl 0916.05023
Cicerone, Serafino; Di Stefano, Gabriele
3
1998
Networks with small stretch number (Extended abstract). Zbl 0988.68567
Cicerone, Serafino; Di Stefano, Gabriele
3
2000
\((k,+)\)-distance-hereditary graphs. Zbl 1042.68622
Cicerone, Serafino; D’Ermiliis, Gianluca; Di Stefano, Gabriele
3
2001
Treelike comparability graphs: Characterization, recognition, and applications. Zbl 1112.68415
Cornelsen, Sabine; Di Stefano, Gabriele
3
2004
Delay management problem: Complexity results and robust algorithms. Zbl 1168.90344
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
3
2008
On minimum \(k\)-modal partitions of permutations. Zbl 1173.90482
Di Stefano, Gabriele; Krause, Stefan; Lübbecke, Marco E.; Zimmermann, Uwe T.
3
2008
On minimum \(k\)-modal partitions of permutations. Zbl 1145.90435
Di Stefano, Gabriele; Krause, Stefan; Lübbecke, Marco E.; Zimmermann, Uwe T.
3
2006
Gathering robots in graphs: the central role of synchronicity. Zbl 1464.68440
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
3
2021
Variety of mutual-visibility problems in graphs. Zbl 07739129
Cicerone, Serafino; Di Stefano, Gabriele; Drožđek, Lara; Hedžet, Jaka; Klavžar, Sandi; Yero, Ismael G.
3
2023
Recoverable robustness for train shunting problems. Zbl 1277.90060
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
3
2009
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Zbl 1259.90032
Cicerone, Serafino; Di Stefano, Gabriele; Schachtebeck, Michael; Schöbel, Anita
2
2012
Min-max coverage in multi-interface networks. Zbl 1298.68199
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
2
2011
Recoverable robust timetables on trees. Zbl 1246.90052
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Pinotti, Cristina M.
2
2009
Distance-hereditary comparability graphs. Zbl 1268.05056
Di Stefano, Gabriele
2
2009
Arbitrary pattern formation on infinite regular tessellation graphs. Zbl 07635990
Cicerone, Serafino; Di Fonso, Alessia; Di Stefano, Gabriele; Navarra, Alfredo
2
2023
Engineering a new algorithm for distributed shortest paths on dynamic networks. Zbl 1262.68019
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Maurizio, Vinicio
2
2013
Bamboo garden trimming problem: priority schedulings. Zbl 1461.90043
D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo
2
2019
Online bounded coloring of permutation and overlap graphs. Zbl 1341.05069
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin
1
2008
Self-spanner graphs. Zbl 1071.05029
Cicerone, Serafino; Di Stefano, Gabriele; Handke, Dagmar
1
2005
Minimize the maximum duty in multi-interface networks. Zbl 1236.68009
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
1
2012
Static and dynamic low-congested interval routing schemes. Zbl 1002.68002
Cicerone, Serafino; Di Stefano, Gabriele; Flammini, Michele
1
2002
Flow problems in multi-interface networks. Zbl 1364.68052
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
1
2014
Decomposing octilinear polygons into triangles and rectangles. Zbl 1452.68245
Cicerone, Serafino; Di Stefano, Gabriele
1
2014
Priority scheduling in the bamboo garden trimming problem. Zbl 1444.90052
D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo
1
2019
Approximation algorithms for decomposing octilinear polygons. Zbl 1426.68270
Cicerone, Serafino; Di Stefano, Gabriele
1
2019
A structured methodology for designing distributed algorithms for mobile entities. Zbl 07775603
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
1
2021
Fair hitting sequence problem: scheduling activities with varied frequency requirements. Zbl 1525.90195
Cicerone, Serafino; Di Stefano, Gabriele; Gasieniec, Leszek; Jurdzinski, Tomasz; Navarra, Alfredo; Radzik, Tomasz; Stachowiak, Grzegorz
1
2019
On the mutual visibility in Cartesian products and triangle-free graphs. Zbl 1510.05251
Cicerone, Serafino; Di Stefano, Gabriele; Klavžar, Sandi
4
2023
Variety of mutual-visibility problems in graphs. Zbl 07739129
Cicerone, Serafino; Di Stefano, Gabriele; Drožđek, Lara; Hedžet, Jaka; Klavžar, Sandi; Yero, Ismael G.
3
2023
Arbitrary pattern formation on infinite regular tessellation graphs. Zbl 07635990
Cicerone, Serafino; Di Fonso, Alessia; Di Stefano, Gabriele; Navarra, Alfredo
2
2023
Mutual visibility in graphs. Zbl 1510.05054
Di Stefano, Gabriele
6
2022
Gathering robots in graphs: the central role of synchronicity. Zbl 1464.68440
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
3
2021
A structured methodology for designing distributed algorithms for mobile entities. Zbl 07775603
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
1
2021
Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Zbl 1432.68024
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
10
2019
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies. Zbl 07176656
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
8
2019
Embedded pattern formation by asynchronous robots without chirality. Zbl 1432.68025
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
6
2019
Bamboo garden trimming problem: priority schedulings. Zbl 1461.90043
D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo
2
2019
Priority scheduling in the bamboo garden trimming problem. Zbl 1444.90052
D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo
1
2019
Approximation algorithms for decomposing octilinear polygons. Zbl 1426.68270
Cicerone, Serafino; Di Stefano, Gabriele
1
2019
Fair hitting sequence problem: scheduling activities with varied frequency requirements. Zbl 1525.90195
Cicerone, Serafino; Di Stefano, Gabriele; Gasieniec, Leszek; Jurdzinski, Tomasz; Navarra, Alfredo; Radzik, Tomasz; Stachowiak, Grzegorz
1
2019
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Zbl 1425.68413
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
10
2018
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Zbl 1407.68531
D’Emidio, Mattia; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
8
2018
Gathering of oblivious robots on infinite grids with minimum traveled distance. Zbl 1370.68286
Di Stefano, Gabriele; Navarra, Alfredo
14
2017
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Zbl 1419.68184
Di Stefano, Gabriele; Navarra, Alfredo
13
2017
Gathering of robots on anonymous grids and trees without multiplicity detection. Zbl 1332.68167
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Klasing, Ralf; Navarra, Alfredo
23
2016
About ungatherability of oblivious and asynchronous robots on anonymous rings. Zbl 1474.68381
Di Stefano, Gabriele; Montanari, Pietro; Navarra, Alfredo
5
2016
Asynchronous embedded pattern formation without orientation. Zbl 1393.68183
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
4
2016
Computing on rings by oblivious robots: a unified approach for different tasks. Zbl 1319.68025
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Nisse, Nicolas; Suchan, Karol
9
2015
Minmax-distance gathering on given meeting points. Zbl 1459.68211
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo
5
2015
Gathering on rings under the look-compute-move model. Zbl 1320.68046
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
25
2014
Gathering six oblivious robots on anonymous symmetric rings. Zbl 1298.68270
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
15
2014
Flow problems in multi-interface networks. Zbl 1364.68052
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
1
2014
Decomposing octilinear polygons into triangles and rectangles. Zbl 1452.68245
Cicerone, Serafino; Di Stefano, Gabriele
1
2014
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. Zbl 1356.68016
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
13
2013
Optimal gathering of oblivious robots in anonymous graphs. Zbl 1406.68109
Di Stefano, Gabriele; Navarra, Alfredo
7
2013
Engineering a new algorithm for distributed shortest paths on dynamic networks. Zbl 1262.68019
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Maurizio, Vinicio
2
2013
How to gather asynchronous oblivious robots on anonymous rings. Zbl 1377.68035
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
8
2012
Distance-hereditary comparability graphs. Zbl 1254.05155
Di Stefano, Gabriele
5
2012
On the online track assignment problem. Zbl 1238.90088
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin
4
2012
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Zbl 1259.90032
Cicerone, Serafino; Di Stefano, Gabriele; Schachtebeck, Michael; Schöbel, Anita
2
2012
Minimize the maximum duty in multi-interface networks. Zbl 1236.68009
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
1
2012
Recoverable robust timetables: an algorithmic approach on trees. Zbl 1368.68120
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Pinotti, Cristina M.
4
2011
Bandwidth constrained multi-interface networks. Zbl 1298.68200
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
3
2011
Min-max coverage in multi-interface networks. Zbl 1298.68199
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
2
2011
Minimizing the maximum duty for connectivity in multi-interface networks. Zbl 1311.90022
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo
4
2010
Partially dynamic efficient algorithms for distributed shortest paths. Zbl 1187.68699
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele
3
2010
Recoverable robustness in shunting and timetabling. Zbl 1266.90036
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo; Schachtebeck, Michael; Schöbel, Anita
15
2009
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. Zbl 1176.90203
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
8
2009
Treelike comparability graphs. Zbl 1204.05037
Cornelsen, Sabine; di Stefano, Gabriele
3
2009
Recoverable robustness for train shunting problems. Zbl 1277.90060
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
3
2009
Recoverable robust timetables on trees. Zbl 1246.90052
D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo; Pinotti, Cristina M.
2
2009
Distance-hereditary comparability graphs. Zbl 1268.05056
Di Stefano, Gabriele
2
2009
Dynamic multi-level overlay graphs for shortest paths. Zbl 1158.68053
Bruera, Francesco; Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele
9
2008
Dynamic algorithms for recoverable robustness problems. Zbl 1247.90038
Cicerone, Serafino; Di Stefano, Gabriele; Schachtebeck, Michael; Schöbel, Anita
4
2008
Delay management problem: Complexity results and robust algorithms. Zbl 1168.90344
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
3
2008
On minimum \(k\)-modal partitions of permutations. Zbl 1173.90482
Di Stefano, Gabriele; Krause, Stefan; Lübbecke, Marco E.; Zimmermann, Uwe T.
3
2008
Online bounded coloring of permutation and overlap graphs. Zbl 1341.05069
Demange, Marc; Di Stefano, Gabriele; Leroy-Beaulieu, Benjamin
1
2008
Track assignment. Zbl 1122.90085
Cornelsen, Sabine; Di Stefano, Gabriele
9
2007
Robust algorithms and price of robustness in shunting problems. Zbl 1247.90037
Cicerone, Serafino; D’Angelo, Gianlorenzo; Di Stefano, Gabriele; Frigioni, Daniele; Navarra, Alfredo
4
2007
On minimum \(k\)-modal partitions of permutations. Zbl 1145.90435
Di Stefano, Gabriele; Krause, Stefan; Lübbecke, Marco E.; Zimmermann, Uwe T.
3
2006
Self-spanner graphs. Zbl 1071.05029
Cicerone, Serafino; Di Stefano, Gabriele; Handke, Dagmar
1
2005
A graph theoretical approach to the shunting problem. Zbl 1271.90012
Di Stefano, Gabriele; Koči, Magnus Love
14
2004
Networks with small stretch number. Zbl 1118.68583
Cicerone, Serafino; Di Stefano, Gabriele
4
2004
Treelike comparability graphs: Characterization, recognition, and applications. Zbl 1112.68415
Cornelsen, Sabine; Di Stefano, Gabriele
3
2004
(\(k,+\))-distance-hereditary graphs. Zbl 1074.68042
Cicerone, Serafino; Di Stefano, Gabriele
5
2003
A fully dynamic algorithm for distributed shortest paths. Zbl 1044.68165
Cicerone, Serafino; Di Stefano, Gabriele; Frigioni, Daniele; Nanni, Umberto
5
2003
Static and dynamic low-congested interval routing schemes. Zbl 1002.68002
Cicerone, Serafino; Di Stefano, Gabriele; Flammini, Michele
1
2002
Compact-port routing models and applications to distance-hereditary graphs. Zbl 0999.68015
Cicerone, Serafino; Di Stefano, Gabriele; Flammini, Michele
7
2001
Graphs with bounded induced distance. Zbl 0965.05040
Cicerone, Serafino; Di Stefano, Gabriele
6
2001
\((k,+)\)-distance-hereditary graphs. Zbl 1042.68622
Cicerone, Serafino; D’Ermiliis, Gianluca; Di Stefano, Gabriele
3
2001
Networks with small stretch number (Extended abstract). Zbl 0988.68567
Cicerone, Serafino; Di Stefano, Gabriele
3
2000
Graph classes between parity and distance-hereditary graphs. Zbl 0933.05144
Cicerone, Serafino; Di Stefano, Gabriele
10
1999
On the extension of bipartite to parity graphs. Zbl 0933.05132
Cicerone, Serafino; Di Stefano, Gabriele
8
1999
Survivable networks with bounded delay: The edge failure case. (Extended abstract). Zbl 0964.68110
Cicerone, Serafino; Di Stefano, Gabriele; Handke, Dagmar
3
1999
Graphs with bounded induced distance. Zbl 0916.05023
Cicerone, Serafino; Di Stefano, Gabriele
3
1998
all top 5

Cited by 278 Authors

41 Di Stefano, Gabriele
28 Navarra, Alfredo
22 Cicerone, Serafino
20 D’Angelo, Gianlorenzo
14 Frigioni, Daniele
11 D’Emidio, Mattia
5 Demange, Marc
5 Klavžar, Sandi
5 Sau, Buddhadeb
5 Schöbel, Anita
4 Aïder, Méziane
4 Bhagat, Subhash
4 Bose, Kaustav
4 Flocchini, Paola
4 Goerigk, Marc
4 Mukhopadhyaya, Krishnendu
4 Tixeuil, Sébastien
3 Chakraborty, Abhinav
3 Das, Bibhuti
3 Dieudonné, Yoann
3 Leucci, Stefano
3 Lusby, Richard Martin
3 Paul, Christophe
3 Pinotti, Cristina M.
3 Proietti, Guido
3 Santoro, Nicola
3 Wada, Koichi
2 Adhikary, Ranendu
2 Alistarh, Dan
2 Apollonio, Nicola
2 Bampas, Evangelos
2 Boysen, Nils
2 Büsing, Christina
2 Caramia, Massimiliano
2 Cionini, Alessio
2 Cornelsen, Sabine
2 D’Andrea, Annalisa
2 Das, Archak
2 Das, Shantanu
2 Di Fonso, Alessia
2 Ellen, Faith
2 Emde, Simon
2 Fischer, Matthias
2 Franciosa, Paolo Giulio
2 Gąsieniec, Leszek Antoni
2 Gavoille, Cyril
2 Giannakopoulou, Kalliopi
2 Gioan, Emeric
2 Hoogeveen, Johannes Adzer
2 Jung, Daniel
2 Klasing, Ralf
2 Koster, Arie M. C. A.
2 Kundu, Manash Kumar
2 Kutschka, Manuel
2 Kwon, O. joung
2 Leroy-Beaulieu, Benjamin
2 Meslem, Kahina
2 Meyer auf der Heide, Friedhelm
2 Nisse, Nicolas
2 Olsen, Martin Aastrup
2 Ooshita, Fukuhito
2 Otto, Alena
2 Paraskevopoulos, Andreas
2 Pelc, Andrzej
2 Potop-Butucaru, Maria Gradinariu
2 Rus, Gregor
2 Rybicki, Joel
2 Tönissen, Denise D.
2 Toth, Paolo
2 van den Akker, J. Marjan
2 Viglietta, Giovanni
2 Zaroliagis, Christos D.
1 Alcántara, Manuel
1 Aliakbari, Mina
1 Almethen, Abdullah
1 Alpern, Steve
1 Andersen, Lars Nørvang
1 Arroyuelo, Diego
1 Athanassopoulos, Stavros
1 Audrito, Giorgio
1 Bärtschi, Andreas
1 Bauer, Reinhard
1 Bendotti, Pascale
1 Bérard, Béatrice
1 Bertossi, Alan A.
1 Bilò, Davide
1 Blackburn, Simon R.
1 Blin, Lélia
1 Boeuf, Vianney
1 Bojović, Nebojša J.
1 Boria, Nicolas
1 Bouchard, Sébastien
1 Bouman, P. C.
1 Bournat, Marjorie
1 Brešar, Boštjan
1 Buchin, Kevin
1 Bull, Simon
1 Buwaya, Julia
1 Cacchiani, Valentina
1 Cadarso, Luis
...and 178 more Authors

Citations by Year