AMANDA Publications

AMANDA Results

WP1 Massive Data Sets

Task 1.1. Algorithms for Emerging Computational Models

Expected result [a]

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri. Network-Oblivious Algorithms. Technical Report arXiv:1404.3318, Cornell University, 2014.
Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh. MapReduce Triangle Enumeration With Guarantees. In Proc. 23rd ACM International Conference on Information and Knowledge Management (CIKM'14), 2014.
Michele Scquizzato, Francesco Silvestri. Communication Lower Bounds for Distributed-Memory Computations. In Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS'14), 2014.
Francesco Silvestri. Subgraph Enumeration in Massive Graphs. Technical Report arXiv:1402.3444, Cornell University, 2014.
Francesco Silvestri. Subgraph Enumeration in Massive Graphs. 6th Workshop on Massive Data Algorithmics, 2014.
Matteo Ceccarello, Francesco Silvestri. Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. In Proc. 17th SIAM Meeting on Algorithm Engineering & Experiments (ALENEX), 2015.
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin. Space-Efficient Parallel Algorithms for Combinatorial Search Problems. J. Parallel Distributed Computing 76:58-65, 2015.
Rasmus Pagh, Ninh Pham, Morten Stockel, Francesco Silvestri. I/O-efficient Similarity Join in High Dimensions. In Proc. of 23rd Annual European Symposium on Algorithms (ESA), 2015.
Rasmus Pagh, Francesco Silvestri. The Input/Output Complexity of Triangle Enumeration. In Proc. 33rd ACM Symposium on Principles of Database Systems (PODS'14), 2014.
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. Proc. 30th IEEE International Parallel and Distributed Processing Symposium, 2016.
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. Proc. 27th ACM Symposium on Parallelism in Algorithms and Architectures, pages 182-191, 2015.
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Technical Report arXiv:1605.05590, Cornell University, 2016.
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri. Network-Oblivious Algorithms. Journal of the ACM, 63(1):3, 2016.
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. PVLDB 10(5): 469-480, 2017.
G. Bilardi, K. Ekanadham, P. Pattnaik. Optimal on-line computation of stack distances for MIN and OPT. ACM International Conference on Computing Frontiers 2017 Siena, Italy, May 15 - 17, 2017.
G. Bilardi, L. De Stefani. The I/O complexity of Strassen's matrix multiplication with recomputation. WADS Algorithms and Data Structures Symposium St. John’s, Canada, July 31 - August 2, 2017.
H.M. Park, F. Silvestri, U. Kang, R. Pagh, C.W. Chung, S.H. Myaeng. CTTP: Enumerating Triangles With Guarantees. Submitted to the VLDB Journal.

Expected result [b]

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. Technical Report arXiv:1407.3144, Cornell University, 2014.
Laercio Pilla, Paolo Rech, Francesco Silvestri, Christopeher Frost, Philippe Navaux, Matteo Sonza Reorda, Luigi Carro. Software-Based Hardening Strategies for Neutron Sensitive FFT Algorithms on GPUs. IEEE Transactions on Nuclear Science. 2014.
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. A Million Edge Drawing for a Fistful of Dollars. Proc. of the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015): 44-51, 2015
L.Pagli, G. Prencipe, G. Viglietta Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. Distributed Computing 28(5) (2015) 333-349.
Flocchini P. Luccio F., Pagli L., Santoro N. Network Decontamination under m-Immunity. Discrete Applied Mathematics, 201 (2016) 114-129.
G. Bilardi, M. Scquizzato, and F. Silvestri. A Lower Bound Technique for Communication on BSP with Application to the FFT. Submitted to ACM Transaction Parallel Computing.
Massimo Bernaschi, Mauro Bisson, Carlo Fantozzi, Carlo Janna. A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units. SIAM J. Scientific Computing 38(1) (2016).

Expected result [c]

Ilkka Norros, Pirkko Kuusela, Jérôme Lapuyade-Lahorgue, Maurizio Naldi, Mika Sirvio Repairable Systems With Dependent Components: Stochastic Process Techniques and Models. IEEE Transactions on Reliability, 63(4): 899-912, 2014.
A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti. Path-Fault-Tolerant Approximate Shortest-Path Trees. Proc. 22th Colloquium on Structural Information and Communication Complexity (SIROCCO15). Lecture Notes in Computer Science, n.9439, pp. 224-238, Springer, 2015.
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri. Resilient dynamic programming. Algorithmica, 77(2): 389-425, 2017
Lorenzo De Stefani, Francesco Silvestri. Exploiting non-constant safe memory in resilient algorithms and data structures. Theoretical Computer Science. 2015.
G. Ausiello, P. G. Franciosa, G. F. Italiano, A. Ribichini. On Resilient Graph Spanners. Algorithmica. vol. 74 (4), 1363-1385, 2016.
Luccio F., Mans B., Mathieson L., Pagli L. Complete Balancing via Rotations . Computer Journal 59(8): 1252-1263, 2016

Expected result [d]

Anna Bernasconi, Valentina Ciriani, Lorenzo Lago. On the error resilience of ordered binary decision diagrams.. Theoretical Computer Science 595: 11-33 (2015).
Anna Bernasconi, Valentina Ciriani. Index-Resilient Zero-Suppressed BDDs: Definition and Operations. ACM Transactions on Design Automation of Electronic Systems 21, No. 4, Article 72 (2016).
Anna Bernasconi, Valentina Ciriani. Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults.. In Proc. 8th IFIP Theoretical Computer Science (TCS '14), Rome, Italy, September 1-3, 2014.

Expected result [e]

T.Marschall et al. ("The Computational Pan-Genomics Consortium"): Computational Pan-Genomics: Status, Promises and Challenges. Briefings in Bioinformatics, DOI:https://doi.org/10.1093/bib/bbw089, 2016.

Expected result [f]

Fabrizio Luccio An Arithmetic for Rooted Trees . In Proc. of Eighth International Conference on Fun with Algorithms (FUN 2016) 2016.

Task 1.2. Algorithms for Data-Intensive Computing

Expected result [g]

Federica Bogo, Javier Romero, Enoch Peserico, Michael J. Black. Automated Detection of New or Evolving Melanocytic Lesions Using a 3D Body Model. In Proc. of the Annual Conference of the Medical Image Computing and Computer Assisted Intervention Society (MICCAI '14), 2014

Expected result [h]

Federica Bogo, Javier Romero, Enoch Peserico, Michael J. Black. Automated Detection of New or Evolving Melanocytic Lesions Using a 3D Body Model. In Proc. of the Annual Conference of the Medical Image Computing and Computer Assisted Intervention Society (MICCAI '14), 2014
Nicola Lazzarini, Loris Nanni, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Teresa Maria Seccia, Gian Paolo Rossi. Heterogeneous Machine Learning System for Improving the Diagnosis of Primary Aldosteronism. Pattern Recognition Letters 65:124-130, 2015
Matteo Comin, Michele Schimd. Fast Comparison of Genomic and Meta-Genomic Reads with Alignment-Free Measures based on Quality Values. In Proc. 5th Annual Translational Bioinformatics Conference (TBC '15) 2015.
R.Grossi, C.S.Iliopulos, R.Mercas, N.Pisanti, S.P.Pissis, A.Retha, F.Vayani. Circular Sequence Comparison: Algorithms and Applications. Algorithms for Molecular Biology, 11(1), 12, 2016.
M.Federico, P.Peterlongo, N.Pisanti, M.-F.Sagot. RIME: Repeat Identification. Discrete Applied Mathematics, 163(3), 275-286, 2014.
M.F.Zini, S.Bonaretti, N.Pisanti, E.Biasci, A.Podda, V.Mey, F.Piras, G.L.L'Abbate, S.Marini, D.Fratta, S.Trasciatti. Preclinical Tests for Cerebral Stroke. In Proc. 7th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) and Network Enabled Health Informatics, Biomedicine and Bioinformatics (Hi-Bi-Bi ’15), 2015.
R.Grossi, C.S.Iliopoulos, R.Mercas, N.Pisanti, S.P.Pissis, A.Retha, F.Vayiani. Circular Sequence Comparison with q-grams. In Proc. 15th International Conference on Algorithms in BioInformatics (WABI ’15), 2015.
Loris Nanni, Carlo Fantozzi, Nicola Lazzarini. Coupling different methods for overcoming the class imbalance problem. Neurocomputing 158: 48-61 (2015).

Expected result [i]

Donatella Firmani, Giuseppe F. Italiano, Marco Querini. Engineering Color Barcode Algorithms for Mobile Applications. In Proc. 13th International Symposium on Experimental Algorithms (SEA 2014), 2014: 211-222.
Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano. Handwritten Signature Verification with 2D Color Barcodes. In Proc. 2014 Federated Conference on Computer Science and Information Systems (FedCSIS 2014), 2014: 701-708.
Marco Querini, Giuseppe F. Italiano. Reliability and Data Density in High Capacity Color Barcodes. Computer Science and Information Systems, vol. 11(4):1595-1615, 2014
Alessio Conte, Roberto Grossi, Andrea Marino. Clique Covering of Large Real-World Networks. SAC 2016: 31st Annual ACM Symposium on Applied Computing
Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone. Finding All Maximal Cliques in Very Large Social Networks. Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016.
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari. Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. Automata, Languages, and Programming - 43rd International Colloquium, ICALP 2016
A.Bracciali, M.Aldinucci, M.Patterson, T.Marschall, N.Pisanti, I.Merelli, M.Torquati. pWhatsHap: efficient haplotyping for future generation sequencing,. BMC Bioinformatics, 17(S-11):342, 2016.
P.Bonizzoni, R.Dondi, G.W.Klau, Y.Pirola, N.Pisanti, S.Zaccaria. On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes,. Journal of Computational Biology, 23(0), 1-19, 2016.
Y.Pirola, S.Zaccaria, R.Dondi, G.W.Klau, N.Pisanti, P.Bonizzoni. HapCol: Accurate and Memory-efficient Haplotype Assembly from Long Reads. Bioinformatics, 32(11), 1610-1617, 2016.
M.Patterson, T.Marschall, N.Pisanti, L.van Iersel, L.Stougie, G.W.Klau, A.Schonhuth. WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads. Journal of Computational Biology, 22(6), 498-509, 2015.
M.Martin, M.Patterson, S.Garg, N.Pisanti, G.W.Klau, A.Schonhuth, T.Marschall. Read-Based Phasing Using WhatsHap. Technical Track at Intelligent Systems for Molecular Biology Conference (ISMB ’16), 2016.
P.Bonizzoni, R.Dondi, G.W.Klau, Y.Pirola, N.Pisanti and S.Zaccaria. On the Tractability and Approximability of the Minimum Error Correction problem for Haplotype Assembly. In Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM ’15), 2015.
M. Aldinucci, A. Bracciali, T. Marschall, M. Patterson, N. Pisanti, M. Torquati. High-Performance Haplotype Assembly. Selected papers from the 11th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics, LNCS 8623, 2015.
R.Grossi, G.Menconi, N.Pisanti, R.Trani, S.Vind. Output-Sensitive Pattern Extraction in Sequences. In Proc. 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS ’14), 2014.
M. Aldinucci, A. Bracciali, N. Pisanti, M. Torquati. Towards High-Performance Haplotype Assembly for Future Generation Sequencing. IN Proc. 11th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics (CIBB ’14), 2014.
Murray Patterson, Tobias Marschall, Nadia Pisanti, Leo van Iersel, Leen Stougie, Gunnar W. Klau and Alexander Schoenhuth. WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads. In Proc. 18th ACM Annual International Conference on Research in Computational Molecular Biology (RECOMB ’14), 2014.
M. Querini, M. Gattelli, V. M. Gentile, G. F. Italiano. A New System for Secure Handwritten Signing of Documents. International Journal of Computer Science and Applications, vol. 12(2), 37-56, 2015.
N. Paudel, M. Querini, G. F. Italiano. Handwritten Signature Verification for Mobile Phones. In Proc. 2nd International Conference on Information Systems Security and Privacy (ICISSP 2016), 2016: 46-52.
G. Bottazzi, G. F. Italiano, G. G. Rutigliano. Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. In Proc. 9th International Conference on Security of Information and Networks (SIN 2016), 2016: 76-80.
G. Bottazzi, G. F. Italiano. Fast Mining of Large-Scale Logs for Botnet Detection: A Field Study. In Proc. 13th IEEE International Conference on Dependable, Autonomic and Secure Computing, 2015: 1989-1996.
Bomersbach, A, Chiarandini, M., Vandin, F. An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer. 16th Workshop On Algorithms in Bioinformatics (WABI), 2016.
Hansen, T., and Vandin. F. Finding Mutated Subnetworks Associated with Survival in Cancer. Technical Report arXiv:1604.02467v2, Cornell University, 2016.

Expected result [j]

Expected result [k]

Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta. Estimating the empirical cost function of routines with dynamic workloads. In Proc. 12th ACM/IEEE International Symposium on Code Generation and Optimization (CGO'14), 2014.
Camil Demetrescu, Irene Finocchi, Andrea Ribichini. Reactive Imperative Programming with Dataflow Constraints. ACM Transactions on Programming Languages and Systems. 37(1): 3:1-3:53, 2014.
Emilio Coppa, Camil Demetrescu, Irene Finocchi. Input-Sensitive Profiling. IEEE Transactions on Software Engineering. 40(12): 1185-1205, 2014.
Daniele Cono D'Elia, Camil Demetrescu, and Irene Finocchi. Mining hot calling contexts in small space. Software Practice and Experience. 1-22, 2015. Online August 1, 2015
Daniele Cono D'Elia and Camil Demetrescu. Flexible On-Stack Replacement in LLVM. In Proc. 14th Annual IEEE/ACM Symposium on Code Generation and Optimization (CGO '16), 2016.
Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli, Roberto Tamassia BitConeView: Visualization of Flows in the Bitcoin Transaction Graph. In Proc. 12th IEEE Symposium on Visualization for Cyber Security (VizSec '15), 2015.
Giordano Da Lozzo and Ignaz Rutter. Planarity of Streamed Graphs. In Proc. 9th International Conference on Algorithms and Complexity (CIAC '15), 2015.

WP2 Massive and Evolving Networked Data Sets

Task 2.1. Algorithms for Computing Network Structural Properties

Expected result [m]

Luca Allulli, Giuseppe F. Italiano, Federico Santaroni. Exploiting GPS Data in Public Transport Journey Planners. In Proc. 13th International Symposium on Experimental Algorithms (SEA 2014), 2014: 295-306.
Pierre Coucheney, Giuseppe D’Acquisto, Patrick Maillé, Maurizio Naldi, Bruno Tuffin Influence of search neutrality on the economics of advertisement-financed content. ACM Transactions on Internet Technology, 14(2-3), 2014.
D. Delling, G. F. Italiano, T. Pajor, F. Santaroni. Better transit routing by exploiting vehicle GPS data. In Proc. 7th ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS 2014), 2014: 31-40.

Expected result [n]

A. Cionini, G. D'Angelo, M. D'Emidio, D. Frigioni, K. Giannakopoulou, A. Paraskevopoulos, C. Zaroliagis. Engineering Graph-Based Models for Dynamic Timetable Information Systems. Proceedings 14th ATMOS Workshop (ATMOS14). Open Access Series in Informatics, vol. 42, pp. 46--62, Schloss Daghstul, 2014.
Pierluigi Crescenzi, Pierre Fraigniaud, Magnus M. Halldorsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci. On the Complexity of the Shortest-Path Broadcast Problem. Discrete Applied Mathematics 199:101-109, 2016.
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri Rumor spreading in random evolving graphs. Random Structures & Algorithms 48(2): 290-312 (2016).
M. Samory, F. Bogo, and E. Peserico. Community structure and interaction dynamics through the lens of quotes. In Proceedings of the 8th ACM Conference on Web Science - WebSci '16, 2016, pp. 358-359.
M. Samory, V.-M. Cappelleri, and E. Peserico. Quotes Reveal Community Structure and Interaction Dynamics. In Proceedings of the 20th ACM Conference on Computer-Supported Cooperative Work and Social Computing - CSCW'17, 322-335, 2017.

Expected result [o]

D. Firmani, L. Georgiadis, G. F. Italiano, L. Laura, F. Santaroni. Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica, vol. 74 (3), 1123-1147, 2016.
Donatella Firmani, Giuseppe F. Italiano, Luigi Laura. The (not so) Critical Nodes of Criminal Networks. In Proc. of SocInfo 2014 International Workshops, 2014: 87-96.
Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams. Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. In Proc. 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1681-1697, 2015.
S. Chechik, T. D. Hansen, G. F. Italiano, J. Lacki, N. Parotsidis. Decremental Single-Source Reachability and Strongly Connected Components in $\tilde{O}(m \sqrt{n})$ Total Update Time. In Proc. 57th IEEE Symposium on Foundations of Computer Science (FOCS 2016), 2016.
L. Georgiadis, G. F. Italiano, N. Parotsidis. 2-Connectivity in Directed Graphs. In Proc. 24th European Symposium on Algorithms (ESA 2016), 2016: 1-14.
L. Georgiadis, G. F. Italiano, N. Parotsidis. Incremental 2-Edge-Connectivity in Directed Graphs. In Proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), 2016.
L. Georgiadis, G. F. Italiano, A. Karanasiou, C. Papadopoulos, N. Parotsidis. Sparse Subgraphs for 2-Connectivity in Directed Graphs. In Proc. 15th International Symposium on Experimental Algorithms (SEA 2016), 2016: 150-166.
L. Georgiadis, G. F. Italiano, L. Laura, N. Parotsidis. 2-Edge Connectivity in Directed Graphs ACM Trans. Algorithms 13(1): 9:1-9:24, 2016.

Expected result [p]

Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre. Utilitarian Mechanism Design for Multi-Objective Optimization. SIAM Journal on Computing, 43(4), 1263-1290, 2014.
Fabrizio Grandoni, R. Ravi, Mohit Singh., Rico Zenklusen. New Approaches to Multi-Objective Optimization. Mathematical Programming, 146(1-2), 525-554, 2014.
Maurizio Naldi. Balancing Leasing and Insurance Costs to Achieve Total Risk Coverage in Cloud Storage Multi-Homing. In Proc. 11th International Conference on Economics of Grids, Clouds, Systems and Services (GECON '14), 2014.
Maurizio Naldi. Forecast Uncertainty in Procurement Decisions for Cloud Storage. In Proc. UKSim-AMSS 16th International Conference on Computer Modelling and Simulation (UKSim '14), 2014.
Maurizio Naldi, Marta Flamini. Interval Estimation of the Herfindahl-Hirschman Index Under Incomplete Market Information. In Proc. UKSim-AMSS 16th International Conference on Computer Modelling and Simulation (UKSim '14), 2014.
Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Routing with Pathlets. Computer Communications. 46:76-86. 2014.
Maurizio Naldi, Loretta Mastroeni. Economic decision criteria for the migration to cloud storage. European Journal of Information Systems 25(1): 16-28, 2016.
Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Supporting End-to-End Connectivity in Federated Networks using SDN. In, Melike Erol-Kantarci, Brendan Jennings, Helmut Reiser, editors, Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2016), 2016. Poster.
Marco Di Bartolomeo, Giuseppe Di Battista, Roberto di Lallo, Claudio Squarcella. Is It Really Worth to Peer At IXPs? A Comparative Study. In Proc. ISCC, 2015.
Roberto di Lallo, Mirko Gradillo, Gabriele Lospoto, Claudio Pisa, Massimo Rimondini. On the Practical Applicability of SDN Research. In, Melike Erol-Kantarci, Brendan Jennings, Helmut Reiser, editors, Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2016), 2016.

Expected result [q]

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano. Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios.. Theory of Computing Systems, vol. 57, n. 2 (2015), pp 444-477, Springer.
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni. A Loop-free Shortest-path Routing Algorithm for Dynamic Networks.. Theoretical Computer Science, vol. 516, (2014), pp. 1-19, Elsevier.

Expected result [r]

Tiziana Calamoneri, Rossella Petreschi. On Pairwise Compatibility Graphs having Dilworth Number Two. Theoretical Computer Science,524, 34--40. 2013, http://dx.doi.org/10.1016/j.tcs.2013.12.015
Tiziana Calamoneri, Rossella Petresci. On Pairwise Compatibility Graphs having Dilworth Number k. Theoretical Computer Science, 547, 82--89. 2014. http://dx.doi.org/10.1016/j.tcs.2014.06.024
Tiziana Calamoneri, Blerina Sinaimeri. Relating threshold tolerance graphs to other graph classes. In Proc. 15th Italian Conference on Theoretical Computer Science (ICTCS '14), 2014.
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 2-Edge Connectivity in Directed Graphs. In Proc. 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), 2015: 1988-2005.
Tiziana Calamoneri e Rossella Petreschi On Dilworth k graphs and their Pairwise Compatibility Proceedings of Workshop on Algorithms and Computation (WALCOM 2014), Chennai, India, LNCS 8344, pp. 213-224, Febbraio 2014
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese. A Mazing $2+\epsilon$ Approximation for Unsplittable Flow on a Path. In Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 26-41, 2014.
M. D'Emidio, D. Frigioni. Engineering Shortest-Path Algorithms for Dynamic Networks. Proceedings 15th Italian Conference on Theoretical Computer Science (ICTCS14). CEUR Workshop Proceedings, vol. 1231, pp. 265--269, 2014.
A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. Proc. 13th International Symposium on Experimental Algorithmics (SEA2014). Lecture Notes in Computer Science, n. 8504, pp. 283--294, Springer 2014.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. Enumerating Cyclic Orientations of a Graph. Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings.
A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti. Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. Journal of Experimental Algorithmics, vol. 20, n. 1 (2015), Article 1.5, ACM.
Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk. An LP-rounding $2\sqrt{2}$-approximation for restricted maximum acyclic subgraph. Information Processing Letters, 115(2): 182-185, 2015.
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 2-Connectivity in Directed Graphs: An Experimental Study. In Proc. 17th Workshop on Algorithm Engineering and Experiments (ALENEX 2015), 2015: 173-187.
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis. Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. In Proc. 23rd European Symp. on Algorithms (ESA 2015): 582-594, 2015.
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano. Design of Dynamic Algorithms via Primal-Dual Method. In Proc. 42nd International Colloquium on Automata, Languages and Programming (ICALP 2015), 2015: 206-218.
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 2-Vertex Connectivity in Directed Graphs. In Proc. 42nd International Colloquium on Automata, Languages and the Programming (ICALP 2015), 2015: 605-617.
E. Grande, G. Nicosia, A. Pacifici. Minimum cost paths over dynamic networks. 7th International Network Optimization Conference, INOC 2015, Warsaw, Poland, May 2015.
E. Grande, G. Nicosia, A. Pacifici. Minimum cost paths over dynamic networks. Electronic Notes in Discrete Mathematics 52: 343-350, 2016.
Patrizio Angelini, Micheal A. Bekos, Michael Kaufmann, Vincenzo Roselli Vertex-Coloring with Star-Defects. Proc. 10th International Workshop on Algorithms and Computation (WALCOM 2016), 2016.
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano. Deterministic fully dynamic data structures for vertex cover and matching. In Proc. 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), 2015: 785-804.
Michael Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann.On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 198-209, 2014
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. Properties and Complexity of Fan-Planarity. Technical Report arXiv:1406.5299, Cornell University, 2014.
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. Fan-Planar Graphs: Combinatorial Properties and Complexity Results. Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 186-197, 2014
Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvil, Fabrizio Montecchiani, Ioannis G. Tollis.2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. Proc. of the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015): 281-294, 2015
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis. Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589: 76-86, 2015
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani.Recognizing and Drawing IC-Planar Graphs. Proc. of the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015): 295-308, 2015
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. Drawing Outer 1-planar Graphs with Few Slopes. Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 174-185, 2014
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. The Planar Slope Number of Subcubic Graphs. LATIN 2014: 132-143, 2014.
Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon. Straight-Line Drawability of a Planar Graph Plus an Edge. In Algorithms and Data Structures - 14th International Symposium, WADS, 2015.
Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Antonios Symvonis, Hsu-Chun Yen. Low ply graph drawing. Proc. of 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015): 1-6, 2015
Giuseppe Liotta, Fabrizio Montecchiani.L-Visibility Drawings of IC-Planar Graphs. Proc. of the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015): 545-547, 2015. Poster
Giuseppe Liotta, Fabrizio Montecchiani. L-visibility drawings of IC-planar graphs. Inf. Process. Lett. 116(3): 217-222, 2016.
Tiziana Calamoneri, Blerina Sinaimeri. On Pairwise Compatibility Graphs: a Survey. SIAM Review 58(3): 445-460, 2016.
Emanuele Fusco, Andrzej Pelc, and Rossella Petreschi Topology recognition with advice. Information and Computation. 247: 254-265, 2016. doi:10.1016/j.ic.2016.01.005
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson. Augmenting Graphs to Minimize the Diameter. Algorithmica. 72(4):995-1010. 2015.
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin. Compatible Connectivity-Augmentation of Disconnected Graphs. In Proc. 26th ACM-SIAM Symposium on Discrete Algorithms (SODA '15), 2015.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari. Directing Road Networks by Listing Strong Orientations. In Proc. 27th International Workshop On Combinatorial Algorithms (IWOCA '16), 2016.
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino On Computing the Hyperbolicity of Real-World Graphs . 23rd Annual European Symposium on Algorithms - ESA 2015, Proceedings.
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke Computing Top-k Closeness Centrality Faster in Unweighted Graphs . Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016.
Vida Dujmovic, Fabrizio Frati. Stack and Queue Layouts via Layered Separators. In Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), 2016.
M. Samory and E. Peserico. Content attribution ignoring content. In Proceedings of the 8th ACM Conference on Web Science - WebSci '16, 2016, pp. 233-243.
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani. On partitioning the edges of 1-plane graphs. Theor. Comput. Sci. 662: 59-65, 2017

Task 2.2. Algorithms and Visual Interfaces for Network Mining

Expected result [s]

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. Technical Report arXiv:1402.4364, Cornell University. 2014.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. In Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP '14), 2014.
Carla Binucci, Walter Didimo, Maurizio Patrignani Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526: 75-89 (2014)
Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani. 1-Bend Orthogonal Partial Edge Drawing. J. Graph Algorithms Appl. 18(1): 111-131 (2014)
Giordano Da Lozzo, Vìt Jelìnek, Jan Kratochvì, Ignaz Rutter. Planar Embeddings with Small and Uniform Faces. In Proc. 25th International Symposium on Algorithms and Computation (ISAAC '14), 633-645, 2014.
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani. Upward-rightward planar drawings. IISA 2014: 145-150, 2014.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath.Planar and Quasi Planar Simultaneous Geometric Embedding. Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 52-63, 2014
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani. On the Complexity of HV-Rectilinear Planarity Testing. Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 343-354, 2014
Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter. Drawing Simultaneously Embedded Graphs with Few Bends.Proc. of 22nd International Symposium on Graph Drawing (GD 2014): 40-51, 2014
Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. Advancements on SEFE and Partitioned Book Embedding Problems. Theoretical Computer Science. 575:71-89. 2014.
Giordano Da Lozzo, Vìt Jelìnek, Jan Kratochvìl, Ignaz Rutter. Planar Embeddings with Small and Uniform Faces. Technical Report arXiv:1409.4299, Cornell University, 2014.
William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani. Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. Proc. of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015): 252-265, 2015.
Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis, Sue Whitesides.Computing upward topological book embeddings of upward planar digraphs. Journal of Discrete Algorithms. 2015.
Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo.Heuristics for the Maximum 2-Layer RAC Subgraph Problem. Comput. J. 58(5): 1085-1098, 2015
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath.Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. 58(11): 3126-3140, 2015
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. Drawing Outer 1-planar Graphs with Few Slopes. J. Graph Algorithms Appl. 19(2): 707-741, 2015
Patrizio Angelini, Carla Binucci, Patrizio Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis Tollis. Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs. Computational Geometry: Theory and Applications. 50:34-48. 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Gunter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. In Proc. 27th ACM-SIAM Symposium on Discrete Algorithms (SODA '16), 2016.
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. L-Drawings of Directed Graphs. In Proc. 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016.
Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli. Optimal Morphs of Convex Drawings. In Proc. 31st Symposium on Computational Geometry (SoCG '15), 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Guenter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. Technical Report arXiv:1510.02659, Cornell University, 2015.
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. L-Drawings of Directed Graph. Technical Report arXiv:1509.00684, Cornell University, 2015.
Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani and Vincenzo Roselli. Optimal Morphs of Convex Drawings. Technical Report arXiv:1503.09021, Cornell University, 2015.
Giordano Da Lozzo and Ignaz Rutter. Planarity of Streamed Graphs. Technical Report arXiv:1501.07106, Cornell University, 2015.
Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. Drawing Planar Graphs with Many Collinear Vertices. In Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), 2016.
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. In Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), 2016.
Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. Drawing Planar Graphs with Many Collinear Vertices. Technical Report arXiv:1606.03890, Cornell University, 2016.
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. Technical Report arXiv:1608.08427, Cornell University, 2016.
Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. Drawing Partially Embedded and Simultaneously Planar Graphs. Journal of Graph Algorithms and Applications, 19(2): 681-706, 2015
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin. Compatible Connectivity-Augmentation of Disconnected Graphs. Discrete and Computational Geometry, 54(2): 459-480, 2015.
Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications, 19(2): 761-778, 2015.
Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson. SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. Journal of Graph Theory, 82(1): 45-64, 2016.
Fabrizio Frati, Michael Hoffmann, Vincent Kusters. Simultaneous Embeddings with Few Bends and Crossings. In Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. In Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), 2016.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. Technical Report arXiv:1510.08274, Cornell University, 2015.

Expected result [t]

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity). In Proc. 22nd International Symposium on Graph Drawing (GD '14), 246--258, 2014.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity). Theoretical Computer Science. 571:1-9. 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli.Relaxing the Constraints of Clustered Planarity. Computational Geometry: Theory and Applications. 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. On the Complexity of Clustered-Level Planarity and T-Level Planarity. Technical Report arXiv:1406.6533, Cornell University, 2014.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing for Embedded Planar Graphs. Algorithmica. 77(4): 1022-1059, 2017.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. In Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015), 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. On the Relationship between Map Graphs and Clique Planar Graphs. In Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015), 2015. Poster.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing Cyclic Level and Simultaneous Level Planarity. Technical Report arXiv:1503.09021, Cornell University, 2015.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. Technical Report arXiv:1508.07557, Cornell University, 2015.
Patrizio Angelini, Giordano Da Lozzo SEFE = C-Planarity?. The Computer Journal 59(12): 1831-1838, 2016.
Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes. In Proc. 27th International Symposium on Algorithms and Computation (ISAAC '16), 2016.
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. In Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), 2016.
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Technical Report arXiv:1608.08952, Cornell University, 2016.

Expected result [u]

Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli. Anchored Drawings of Planar Graphs. In Proc. 22nd International Symposium on Graph Drawing (GD '14), 404-415, 2014.
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vit Jelinek, Jan Kratochvil, Maurizio Patrignani, Ignaz Rutter. Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42, 2015.
Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora. Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. In Proc. 6th International Conference on Information Visualization Theory and Applications, (IVAPP 2015), 2015.
Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. VisFLOWer: Visual analysis of touristic flows. Proc. of 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015): 1-6, 2015

Expected result [v]

Davide Ceneda, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini. RoutingWatch: Visual Exploration and Analysis of Routing Events. In, Melike Erol-Kantarci, Brendan Jennings, Helmut Reiser, editors, Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2016), 2016.
Walter Didimo, Francesco Giacchè, Fabrizio Montecchiani. Kojaph: Visual Definition and Exploration of Patterns in Graph Databases. Proc. of the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015): 272-278, 2015
Valentino Di Donato, Maurizio Patrignani, Claudio Squarcella. NetFork: Mapping Time to Space in Network Visualization. In, Paolo Buono, Rosa Lanzilotti, Maristella Matera, editors, International Working Conference on Advanced User Interfaces (AVI 2016), ACM, New York, pages 92-99, 2016.

Expected result [w]

Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. Network visualization for financial crime detection. J. Vis. Lang. Comput. 25(4): 433-451 (2014)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. Network visualization retargeting. Proc. of 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015): 1-6, 2015
Alessio Arleo, Felice De Luca, Giuseppe Liotta, Fabrizio Montecchiani and Ioannis G. Tollis. GraphBook: Making Graph Paging Real. GD 2014, 2014. Poster
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis. Techniques for Edge Stratification of Complex Graph Drawings. J. Vis. Lang. Comput. 25(4): 533-543 (2014)

Expected result [x]

Walter Didimo, Fabrizio Montecchiani, Evangelos Pallas, Ioannis G. Tollis. How to visualize directed graphs: A user study. IISA 2014: 152-157, 2014.
Walter Didimo, Fabrizio Montecchiani, Evangelos Pallas and Ioannis G. Tollis. A User Study on the Visualization of Directed Graphs. GD 2014, 2014. Poster-

Other papers

Cambi F., Crescenzi P., Pagli L. Analyzing and Comparing On-Line New Sources via (Two layer) Incremental Clustering. In Proc. of Eighth International Conference on Fun with Algorithms (FUN 2016) 2016.
Lorenzo Bettini, Pierluigi Crescenzi Java-- Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach . Proceedings of the 10th International Conference on Software Paradigm Trends, ICSOFT-PT 2015: 31-42
Lorenzo Bettini, Pierluigi Crescenzi An Eclipse IDE for Teaching Java-- . Software Technologies: 10th International Joint Conference, ICSOFT 2015: 31-42
A. Magi, N. Pisanti, L. Tattini. The Source of the Data Flood: Sequencing Technologies. ERCIM News 104, pages 25-26, January 2016.
Keshav Pingali, Gianfranco Bilardi. A Graphical Model for Context-Free Grammar Parsing. In Proc. of 24th Intl. Conference on Compiler Construction, pages 3-27, 2015.
Donatella Firmani, Barna Saha, Divesh Srivastava. Online Entity Resolution Using an Oracle. In Proc. of the VLDB Endowment, Volume 9, 2016.
Vincenzo Baraniello, Chiara Degano, Luigi Laura, Maria Lozano Zahonero, Maurizio Naldi, Sandra Petroni. A Wiki-Based Approach to Computer-Assisted Translation for Collaborative Language Learning. In Proc. of the 8th International Workshop on Social and Personal Computing for Web-Supported Learning Communities (SPeL) 2015.
Maurizio Naldi. A Probability Model for the Size of Investment Projects.. In Proc. IEEE European Modelling Symposium (EMS), 2015.
Maurizio Naldi, Giuseppe D’Acquisto. Option pricing in a privacy-aware market.. In Proc. IEEE Conference on Communications and Network Security (CNS), 2015.
Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee. Improved Approximation Algorithms for Stochastic Matching. In Proc. 23rd Annual European Symposium on Algorithms (ESA), 1-12, 2015.
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti. Improved Purely Additive Fault-Tolerant Spanners. In Proc. 23rd Annual European Symposium on Algorithms (ESA), 167-178, 2015.
Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit. On Survivable Set Connectivity. In Proc. 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 25-36, 2015.
Andreas Baertschi, Fabrizio Grandoni. On Conflict-Free Multi-coloring. In Proc. 14th International Symposium on Algorithms and Data Structures (WADS), 103-114, 2015.
Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal. Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. In Proc. 13th International Workshop on Approximation and Online Algorithms (WAOA), 13-24, 2015.
Tiziana Calamoneri. Optimal L(j, k)-Edge-Labeling of Regular Grids. International Journal on Foundations of Computer Science 26(4), 523-535. 2015.
Tiziana Calamoneri, Angelo Monti, and Rossella Petreschi. Dynamically mantaining minimal integral separator for Threshold and Difference Graphs. In Proc. of 10-th Int.l Workshop on Algorithms and Computation (WALCOM 2016), Kathmandu, Nepal, LNCS 9627, 2016.
Tiziana Calamoneri, Angelo Monti, and Rossella Petreschi. Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). In Proc. of 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization (CTW 2015) , 2015.
Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello. On Pairwise Compatibility of Some Graph (Super)Classes. Technical Report arXiv:1504.06454, Cornell University, 2015.
Tiziana Calamoneri, Angelo Monti, and Rossella Petreschi Dynamically operating on Threshold Graphs and related classes(Extended Abstract), Presented at 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization (CTW 2015) and 16th Italian Conference on Theoretical Computer Science (ICTCS 2015)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski Online Network Design with Outliers. Algorithmica 76(1): 88-109 (2016)
Fabrizio Grandoni, Thomas Rothvoss Pricing on Paths: A PTAS for the Highway Problem. SIAM J. Comput. 45(2): 216-231 (2016)

Webmaster: Maurizio Patrignani (maurizio.patrignani@uniroma3.it)