Alberto Marchetti-Spaccamela

Hubert Charles

PLoS Comput. Biol., 2010

A note on the complexity of finding and enumerating elementary modes.

[BibT_eX]

[DOI]

Biosyst., 2010

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

[BibT_eX]

[DOI]

Vincent Lacroix

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

Universal Sequencing on a Single Machine.

[BibT_eX]

[DOI]

Leah Epstein

Asaf Levin

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Data Gathering in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Data aggregation in sensor networks: Balancing communication and delay costs.

[BibT_eX]

[DOI]

Peter Korteweg

Theor. Comput. Sci., 2009

Balanced cut approximation in random geometric graphs.

[BibT_eX]

[DOI]

Josep Díaz

Fabrizio Grandoni

Theor. Comput. Sci., 2009

Latency-constrained aggregation in sensor networks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Modes and cuts in metabolic networks: Complexity and algorithms.

[BibT_eX]

[DOI]

Flavio Chierichetti

Vincent Lacroix

Biosyst., 2009

Implementation of a Speedup-Optimal Global EDF Schedulability Test.

[BibT_eX]

[DOI]

Sanjoy K. Baruah

Sebastian Stiller

Proceedings of the 21st Euromicro Conference on Real-Time Systems, 2009

2008

Flow Time Minimization.

[BibT_eX]

[DOI]

Kirk Pruhs

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An approximation algorithm for the wireless gathering problem.

[BibT_eX]

[DOI]

Peter Korteweg

Oper. Res. Lett., 2008

Enumerating Precursor Sets of Target Metabolites in a Metabolic Network.

[BibT_eX]

[DOI]

Ludovic Cottret

Paulo Vieira Milreu

Fábio Viduani Martinez

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Self-Adaptive Recommendation Systems: Models and Experimental Analysis.

[BibT_eX]

[DOI]

Ugo Maria Colesanti

Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Minimizing Average Flow Time in Sensor Data Gathering.

[BibT_eX]

[DOI]

Peter Korteweg

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007

Prize-Collecting Traveling Salesman and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

2006

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.

[BibT_eX]

[DOI]

Guido Schäfer

Tjark Vredeveld

Math. Oper. Res., 2006

Preface.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Online weighted flow time and deadline scheduling.

[BibT_eX]

[DOI]

Kirk Pruhs

J. Discrete Algorithms, 2006

Counting triangles in data streams.

[BibT_eX]

[DOI]

Luciana S. Buriol

Gereon Frahling

Christian Sohler

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005

Parallel scheduling problems in next generation wireless networks.

[BibT_eX]

[DOI]

Suhas N. Diggavi

S. Muthukrishnan

Thyagarajan Nandagopal

Networks, 2005

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.

[BibT_eX]

[DOI]

Guido Schäfer

Tjark Vredeveld

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

Semi-clairvoyant scheduling.

[BibT_eX]

[DOI]

Kirk Pruhs

Theor. Comput. Sci., 2004

Approximating call-scheduling makespan in all-optical networks.

[BibT_eX]

[DOI]

Miriam Di Ianni

J. Discrete Algorithms, 2004

Scheduling against an adversarial network.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003

Fully dynamic shortest paths in digraphs with arbitrary arc weights.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Preface.

[BibT_eX]

[DOI]

Bert Gerards

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

Foreword.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

Discret. Appl. Math., 2003

Scheduling to Minimize Flow Time Metrics.

[BibT_eX]

[DOI]

Guido Schäfer

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002

Approximation algorithms for routing and call scheduling in all-optical chains and rings.

[BibT_eX]

[DOI]

Miriam Di Ianni

Theor. Comput. Sci., 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.

[BibT_eX]

[DOI]

Sven Oliver Krumke

Luigi Laura

Maarten Lipmann

Willem de Paepe

Diana Poensgen

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Dynamic algorithms for classes of constraint satisfaction problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

On-line Randomized Call Control Revisited .

[BibT_eX]

[DOI]

Alessio Presciutti

Adi Rosén

SIAM J. Comput., 2001

A Broadcasting Protocol in Line Digraphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Xavier Muñoz

J. Parallel Distributed Comput., 2001

2000

Multiprocessor Scheduling with Rejection.

[BibT_eX]

[DOI]

Yair Bartal

Jirí Sgall

SIAM J. Discret. Math., 2000

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Algorithm Engineering, 2000

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints.

[BibT_eX]

[DOI]

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

Timestamping Algorithms: A Characterization and a Few Properties.

[BibT_eX]

[DOI]

Giovanna Melideo

Marco Mechelli

Roberto Baldoni

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

On Salesmen, Repairmen, Spiders, and Other Traveling Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Computing Surveys' Electronic Symposium on the Theory of Computation.

[BibT_eX]

[DOI]

Pierpaolo Degano

Roberto Gorrieri

Peter Wegner

ACM Comput. Surv., 1999

On-Line Resource Management with Application to Routing and Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 1999

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

[BibT_eX]

[DOI]

Springer, ISBN: 3540654313, 1999

1998

Memory Paging for Connectivity and Path Problems in Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Efficient Token-Based Control in Rings.

[BibT_eX]

[DOI]

Nicola Santoro

Inf. Process. Lett., 1998

The Complexity of Interval Routing on Random Graphs.

[BibT_eX]

[DOI]

Michele Flammini

Jan van Leeuwen

Comput. J., 1998

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 1998

On-Line Routing Problems for Broadband Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

On the Embedding of Refinements of 2-dimensional Grids.

[BibT_eX]

[DOI]

Fabrizio d'Amore

Sergei L. Bezrukov

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.

[BibT_eX]

[DOI]

Paola Alimonti

RAIRO Theor. Informatics Appl., 1996

Maintaining a Topological Order Under Edge Insertions.

[BibT_eX]

[DOI]

Hans Rohnert

Inf. Process. Lett., 1996

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Efficient Token-Based Control in Rings (Abstract).

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Induced Broadcasting Algorithms in Iterated Line Digraphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Xavier Muñoz

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Stochastic on-line knapsack problems.

[BibT_eX]

[DOI]

Carlo Vercellis

Math. Program., 1995

On-line Resource Management with Applications to Routing and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

On Learning Monotone DNF Formulae under Uniform Distributions

[BibT_eX]

[DOI]

Inf. Comput., April, 1994

Incremental Algorithms for the Single-Source Shortest Path Problem.

[BibT_eX]

[DOI]

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

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

The Weighted List Update Problem and the Lazy Adversary.

[BibT_eX]

[DOI]

Fabrizio d'Amore

Theor. Comput. Sci., 1993

Dynamic algorithms for shortest paths in planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On-line Graph Algorithms for Incremental Compilation.

[BibT_eX]

[DOI]

Hans Rohnert

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

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.

[BibT_eX]

[DOI]

Paola Alimonti

Xavier Messeguer

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

1992

On-Line Computation of Minimal and Maximal Length Paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Probabilistic analysis of the minimum weighted flowtime scheduling problem.

[BibT_eX]

[DOI]

Wan Soo Rhee

Sara A. van de Geer

Oper. Res. Lett., 1992

The Complexity of Existential Quantification in Concept Languages.

[BibT_eX]

[DOI]

Artif. Intell., 1992

Learning DNF Formulae Under Classes of Probability Distributions.

[BibT_eX]

[DOI]

Michele Flammini

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Comparison of Methods for Logic-Query Implementation.

[BibT_eX]

[DOI]

Antonella Pelaggi

Domenico Saccà

J. Log. Program., 1991

Incremental Algorithms for Minimal Length Paths.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Competitive Algorithms for the Weighted List Update Problem.

[BibT_eX]

[DOI]

Fabrizio d'Amore

Proceedings of the Algorithms and Data Structures, 1991

1989

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

Learning Under Uniform Distribution.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

On the Estimate of a Directed Graph.

[BibT_eX]

[DOI]

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

Dynamic Maintenance of Paths and Path Expressions on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1988

On the Learnability of DNF Formulae.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

New Protocols for the Election of a Leader in a Ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Worst Case Analysis of Two Heuristics for The Set Partitioning Problem.

[BibT_eX]

[DOI]

Antonella Pelaggi

RAIRO Theor. Informatics Appl., 1987

Worst-case Complexity Analysis of Methods for Logic Query Implementation.

[BibT_eX]

[DOI]

Antonella Pelaggi

Domenico Saccà

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract).

[BibT_eX]

[DOI]

Carlo Vercellis

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.

[BibT_eX]

[DOI]

Maurizio Talamo

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

On Different Approximation Criteria for Subset Product Problems.

[BibT_eX]

[DOI]

Giovanni Romano

Inf. Process. Lett., 1985

New Protocols for the Election od a Leader in a Ring.

[BibT_eX]

[DOI]

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

1984

Hierarchical vehicle routing problems.

[BibT_eX]

[DOI]

A. H. G. Rinnooy Kan

Networks, 1984

A Probabilistic Analysis of Multidimensional Bin Packing Problems

[BibT_eX]

[DOI]

Richard M. Karp

Michael Luby

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On Finding the Exact Solution of a Zero-One Knapsack Problem

[BibT_eX]

[DOI]

Andrew V. Goldberg

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

The Largest Tree in a Random Graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Probabilistic Analysis of Two Euclidean Location Problems.

[BibT_eX]

[DOI]

Maurizio Talamo

RAIRO Theor. Informatics Appl., 1983

Probabilistic Analysis of Graph Colouring Algorithms.

[BibT_eX]

[DOI]

Maurizio Talamo

Proceedings of the CAAP'83, 1983

1982

Analysis of a Class of Graph Partitioning Problems.

[BibT_eX]

[DOI]

Paola Bertolazzi

Mario Lucertini

RAIRO Theor. Informatics Appl., 1982

1981

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

Full Approximatibility of a Class of Problems over Power Sets.

[BibT_eX]

[DOI]

Proceedings of the CAAP '81, 1981

1980

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.

[BibT_eX]

[DOI]