Pierluigi Crescenzi

Proceedings of the Structural Information and Communication Complexity, 2023

Giant Components in Random Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

On Computing the Diameter of (Weighted) Link Streams.

[BibT_eX]

[DOI]

Marco Calamai

ACM J. Exp. Algorithmics, 2022

CONCUR through time.

[BibT_eX]

[DOI]

Luca Aceto

Bull. EATCS, 2022

Planning with Biological Neurons and Synapses.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On computing Pareto optimal paths in weighted time-dependent networks.

[BibT_eX]

[DOI]

Filippo Brunelli

Laurent Viennot

Inf. Process. Lett., 2021

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.

[BibT_eX]

[DOI]

Filippo Brunelli

Laurent Viennot

CoRR, 2021

Public Communication can Facilitate Low-Risk Coordination under Surveillance.

[BibT_eX]

[DOI]

Amos Korman

CoRR, 2021

2020

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.

[BibT_eX]

[DOI]

Clémence Magnien

Algorithms, 2020

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Simple and Fast Distributed Computation of Betweenness Centrality.

[BibT_eX]

[DOI]

Ami Paz

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs.

[BibT_eX]

[DOI]

Gabriele Goretti

Benedetta Terenzi

Elisabetta Cianfanelli

Carlo Colombo

Enrico Civitelli

Proceedings of the ICETC'20: 12th International Conference on Education Technology and Computers, 2020

2019

Degrees of Separation and Diameter in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Computing top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2019

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.

[BibT_eX]

[DOI]

Clémence Magnien

Algorithms, 2019

Trade-Offs in Distributed Interactive Proofs.

[BibT_eX]

[DOI]

Ami Paz

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

2018

Improving the Betweenness Centrality of a Node by Adding Links.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

2017

An ant-colony based approach for real-time implicit collaborative information seeking.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Sigil3D: A Crowdsourcing Platform for Interactive 3D Content.

[BibT_eX]

[DOI]

Andrea Barillari

Daniele Bernardini

CoRR, 2017

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Greedily Improving Our Own Closeness Centrality in a Network.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2016

Rumor spreading in random evolving graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

On the complexity of the shortest-path broadcast problem.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Hovhannes A. Harutyunyan

Chiara Pierucci

Andrea Pietracaprina

Geppino Pucci

Discret. Appl. Math., 2016

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.

[BibT_eX]

[DOI]

Francesco Cambi

Linda Pagli

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Core-periphery clustering and collaboration networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Synchronous context-free grammars and optimal linear parsing strategies.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Preface.

[BibT_eX]

[DOI]

Michele Loreti

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.

[BibT_eX]

[DOI]

Michel Habib

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Fast and Simple Computation of Top-k Closeness Centralities.

[BibT_eX]

[DOI]

CoRR, 2015

MeDuSa: a multi-draft based scaffolder.

[BibT_eX]

[DOI]

Bioinform., 2015

EUCALYPT: efficient tree reconciliation enumerator.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2015

Greedily Improving Our Own Centrality in A Network.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

An Eclipse IDE for Teaching Java-.

[BibT_eX]

[DOI]

Lorenzo Bettini

Proceedings of the Software Technologies - 10th International Joint Conference, 2015

Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach.

[BibT_eX]

[DOI]

Lorenzo Bettini

Proceedings of the ICSOFT-PT 2015, 2015

On Computing the Hyperbolicity of Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Blind image clustering based on the Normalized Cuts criterion for camera identification.

[BibT_eX]

[DOI]

Signal Process. Image Commun., 2014

Flooding in dynamic graphs with arbitrary degree sequence.

[BibT_eX]

[DOI]

Hervé Baumann

J. Parallel Distributed Comput., 2014

Into the Square - On the Complexity of Quadratic-Time Solvable Problems.

[BibT_eX]

[DOI]

Michel Habib

CoRR, 2014

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.

[BibT_eX]

[DOI]

Paulo Vieira Milreu

Cecilia Coimbra Klein

Bioinform., 2014

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

On computing the diameter of real-world undirected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Telling Stories Fast.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Requirements and design strategies for open source interactive computer science eBooks.

[BibT_eX]

[DOI]

Proceedings of the ITiCSE working group reports conference on Innovation and technology in computer science education-working group reports, 2013

From theory to practice: NP-completeness for every CS student.

[BibT_eX]

[DOI]

Emma Enström

Viggo Kann

Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013

Rumor Spreading in Random Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course.

[BibT_eX]

[DOI]

J. Educ. Technol. Soc., 2012

On Computing the Diameter of Real-World Directed (Weighted) Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.

[BibT_eX]

[DOI]

Hervé Baumann

Gustavo Akio Tominaga Sacomoto

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient Bubble Enumeration in Directed Graphs.

[BibT_eX]

[DOI]

Marie-France Sagot

Proceedings of the String Processing and Information Retrieval, 2012

Making turing machines accessible to blind students.

[BibT_eX]

[DOI]

Leonardo Rossi

Gianluca Apollaro

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.

[BibT_eX]

[DOI]

Alexandre S. Freire

Vicente Acuña

Carlos Eduardo Ferreira

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Smooth movement and Manhattan path based Random Waypoint mobility.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Parsimonious flooding in dynamic graphs.

[BibT_eX]

[DOI]

Hervé Baumann

Distributed Comput., 2011

On two collateral effects of using algorithm visualizations.

[BibT_eX]

[DOI]

Br. J. Educ. Technol., 2011

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.

[BibT_eX]

[DOI]

M. Gloria Sánchez-Torrubia

Marie-France Sagot

Leen Stougie

Vincent Lacroix

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Adapting moodle to better support CS education.

[BibT_eX]

[DOI]

Proceedings of the 2010 ITiCSE working group reports, 2010

Using AVs to explain NP-completeness.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Foreword.

[BibT_eX]

[DOI]

Fabrizio Luccio

Geppino Pucci

Theory Comput. Syst., 2009

Adding Test Generation to the Teaching Machine.

[BibT_eX]

[DOI]

Michael Bruce-Lockhart

Theodore S. Norvell

ACM Trans. Comput. Educ., 2009

On the connectivity of Bluetooth-based <i>ad hoc</i> networks.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2009

Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Performance Evaluation of a Chord-Based JXTA Implementation.

[BibT_eX]

[DOI]

Carlo Nocentini

Leonardo Lanzi

Proceedings of the First International Conference on Advances in P2P Systems, 2009

2008

Integrating test generation functionality into the Teaching Machine environment.

[BibT_eX]

[DOI]

Michael Bruce-Lockhart

Theodore S. Norvell

Proceedings of the Fifth Program Visualization Workshop, 2008

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

2007

On-line load balancing made simple: Greedy strikes back.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Fully integrating algorithm visualization into a cs2 course.: a two-year experience.

[BibT_eX]

[DOI]

Carlo Nocentini

Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

On the Connectivity of Bluetooth-Based Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

2006

Assessing CS1 java skills: a three-year experience.

[BibT_eX]

[DOI]

Michele Loreti

Rosario Pugliese

Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

2005

NetPrIDE an integrated environment for developing and visualizing computer network protocols.

[BibT_eX]

[DOI]

Giorgio Gambosi

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004

Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications.

[BibT_eX]

[DOI]

Bülent Yener

Mob. Networks Appl., 2004

The minimum likely column cover problem.

[BibT_eX]

[DOI]

Federico Greco

Inf. Process. Lett., 2004

Optimal covering designs: complexity results and new bounds.

[BibT_eX]

[DOI]

Federico Montecalvo

Gianluca Rossi

Discret. Appl. Math., 2004

On-line algorithms for the channel assignment problem in cellular networks.

[BibT_eX]

[DOI]

Giorgio Gambosi

Discret. Appl. Math., 2004

An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Advanced Learning Technologies, 2004

2003

Text sparsification via local maxima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Search Data Structures for Skewed Strings.

[BibT_eX]

[DOI]

Roberto Grossi

Giuseppe F. Italiano

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

C : C++ = JavaMM: Java.

[BibT_eX]

[DOI]

Leonardo Cecchi

Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

A tool to develop electronic course books based on WWW technologies, resources and usability criteria.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003

Online Load Balancing Made Simple: Greedy Strikes Back.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

On the Hamming distance of constraint satisfaction problems.

[BibT_eX]

[DOI]

Gianluca Rossi

Theor. Comput. Sci., 2002

A note on the spatiality degree of graphs.

[BibT_eX]

Sergio De Agostino

Ars Comb., 2002

Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computers in Education, 2002

2001

On Approximating a Scheduling Problem.

[BibT_eX]

[DOI]

Xiaotie Deng

J. Comb. Optim., 2001

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Inf. Comput., 2001

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

On Computing Ad-hoc Selective Families.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

Towards a Taxonomy of Network Protocol Visualization Tools.

[BibT_eX]

[DOI]

Proceedings of the Software Visualization, 2001

2000

Reversible Execution and Visualization of Programs with LEONARDO.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2000

On Approximation Scheme Preserving Reducibility and Its Applications.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

1999

Max NP-completeness Made Easy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Structure in Approximation Classes.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

IP Address Lookup Made Fast and Simple.

[BibT_eX]

[DOI]

Leandro Dardini

Roberto Grossi

Proceedings of the Algorithms, 1999

On the Complexity of Approximating Colored-Graph Problems.

[BibT_eX]

[DOI]

Gianluca Rossi

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Complexity and approximation: combinatorial optimization problems and their approximability properties.

[BibT_eX]

[DOI]

Giorgio Ausiello

Springer, ISBN: 3540654313, 1999

1998

Strictly-upward Drawings of Ordered Search Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

The Parallel Complexity of Approximating the High Degree Subgraph Problem.

[BibT_eX]

[DOI]

Alexander E. Andreev

Theor. Comput. Sci., 1998

How to find the best approximation results.

[BibT_eX]

[DOI]

Viggo Kann

SIGACT News, 1998

On the Complexity of Protein Folding.

[BibT_eX]

[DOI]

Deborah Goldman

Antonio Piccolboni

Mihalis Yannakakis

J. Comput. Biol., 1998

Linear area upward drawings of AVL trees.

[BibT_eX]

[DOI]

Adolfo Piperno

Comput. Geom., 1998

Sperner's Lemma and Robust Machines.

[BibT_eX]

[DOI]

Comput. Complex., 1998

On the Complexity of Protein Folding (Extended Abstract).

[BibT_eX]

[DOI]

Deborah Goldman

Antonio Piccolboni

Mihalis Yannakakis

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

On the complexity of protein folding (abstract).

[BibT_eX]

[DOI]

Deborah Goldman

Antonio Piccolboni

Mihalis Yannakakis

Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

1997

LEONARDO: a software visualization system.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Approximation on the Web: A Compendium of NP Optimization Problems.

[BibT_eX]

[DOI]

Viggo Kann

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Minimum-Area h-v Drawings of Complete Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

A Short Guide to Approximation Preserving Reductions.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1996

Upward Drawings of Search Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Parallel approximation of optimization problems.

[BibT_eX]

[DOI]

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

To Weight or Not to Weight: Where is the Question?

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Reversible Simulation of Space-Bounded Computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Approximate Solution of NP Optimization Problems.

[BibT_eX]

[DOI]

Giorgio Ausiello

Marco Protasi

Theor. Comput. Sci., 1995

Max Sat and Min Set Cover Approximation Algorithms are P-Complete.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

Sergio De Agostino

Parallel Process. Lett., 1995

Complexity Classes and Sparse Oracles.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Parallel Simulated Annealing for Shape Detection.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

Concettina Guerra

Comput. Vis. Image Underst., 1995

Structure in Approximation Classes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Optimal-Area Upward Drawings of AVL Trees.

[BibT_eX]

[DOI]

Adolfo Piperno

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

On Approximation Scheme Preserving Reducability and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Introduction to the theory of complexity.

[BibT_eX]

Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-915380-8, 1994

1993

A Note on the Descriptive Complexity of Maximization.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Average Measure, Descriptive Complexity and Approximation of Maximization Problems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

1992

A Uniform Approach to Define Complexity Classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.

[BibT_eX]

[DOI]

Giuseppe Di Battista

Adolfo Piperno

Comput. Geom., 1992

1991

Completeness in Approximation Classes

[BibT_eX]

[DOI]

Alessandro Panconesi

Inf. Comput., August, 1991

A Note on the Approximation of the MAX CLIQUE Problem.

[BibT_eX]

[DOI]

C. Fiorini

Inf. Process. Lett., 1991

Minimum-Delay Schedules in Layered Networks.

[BibT_eX]

[DOI]

Acta Informatica, 1991

1990

Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Deadlock Prediction in the Case of Dynamic Routing.

[BibT_eX]

[DOI]

Miriam Di Ianni