Stefano Leonardi

Matteo Russo

CoRR, 2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Pandora's Box Problem with Order Constraints.

[BibT_eX]

[DOI]

Math. Oper. Res., February, 2023

Deep active learning for misinformation detection using geometric deep learning.

[BibT_eX]

[DOI]

Giovanni Da San Martino

Fabrizio Silvestri

Online Soc. Networks Media, 2023

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations.

[BibT_eX]

[DOI]

CoRR, 2023

Fair Division with Interdependent Values.

[BibT_eX]

[DOI]

CoRR, 2023

Prophet Inequalities via the Expected Competitive Ratio.

[BibT_eX]

[DOI]

Tomer Ezra

Alexandros Tsigonias-Dimitriadis

Matteo Russo

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Repeated Bilateral Trade Against a Smoothed Adversary.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Tommaso Renato Cesari

Roberto Colomboni

Federico Fusco

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Fully Dynamic Online Selection through Online Contention Resolution Schemes.

[BibT_eX]

[DOI]

Vashist Avadhanula

Andrea Celli

Matteo Russo

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Truthful Matching with Online Items and Offline Agents.

[BibT_eX]

[DOI]

CoRR, 2022

AI-based Data Preparation and Data Analytics in Healthcare: The Case of Diabetes.

[BibT_eX]

[DOI]

Marianna Maranghi

Aris Anagnostopoulos

Irene Cannistraci

Ioannis Chatzigiannakis

CoRR, 2022

Online revenue maximization for server pricing.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.

[BibT_eX]

[DOI]

Constantine Caramanis

Orestis Papadigenopoulos

Emmanouil Pountourakis

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Distortion-Oblivious Algorithms for Minimizing Flow Time.

[BibT_eX]

[DOI]

Yossi Azar

Noam Touitou

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection.

[BibT_eX]

[DOI]

Giovanni Da San Martino

Fabrizio Silvestri

Proceedings of the International Joint Conference on Neural Networks, 2022

Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective.

[BibT_eX]

[DOI]

Georgios Birmpas

Andrea Celli

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Algorithms for fair <i>k</i>-clustering with multiple protected attributes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Bilateral Trade: A Regret Minimization Perspective.

[BibT_eX]

[DOI]

CoRR, 2021

Learning Fair Equilibria in Sponsored Search Auctions.

[BibT_eX]

[DOI]

Andrea Celli

CoRR, 2021

Prophet Inequalities for Matching with a Single Sample.

[BibT_eX]

[DOI]

CoRR, 2021

Budget Feasible Mechanisms on Matroids.

[BibT_eX]

[DOI]

Algorithmica, 2021

Stochastic bandits for multi-platform budget optimization in online advertising.

[BibT_eX]

[DOI]

Vashist Avadhanula

Karthik Abinav Sankararaman

Okke Schrijvers

Proceedings of the WWW '21: The Web Conference 2021, 2021

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Efficient two-sided markets with limited information.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Flow time scheduling with uncertain processing time.

[BibT_eX]

[DOI]

Yossi Azar

Noam Touitou

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Regret Analysis of Bilateral Trade.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Tommaso Renato Cesari

Roberto Colomboni

Federico Fusco

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Approximately Efficient Two-Sided Combinatorial Auctions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2020

FUN editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Prior-free multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fair Clustering with Multiple Colors.

[BibT_eX]

[DOI]

CoRR, 2020

Envy, Regret, and Social Welfare Loss.

[BibT_eX]

[DOI]

Okke Schrijvers

Eric Sodomka

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019

Designing Cost-Sharing Methods for Bayesian Games.

[BibT_eX]

[DOI]

George Christodoulou

Alkmini Sgouritsa

Theory Comput. Syst., 2019

Principal Fairness: \\ Removing Bias via Projections.

[BibT_eX]

[DOI]

CoRR, 2019

Algorithms for Fair Team Formation in Online Labour Marketplaces✱.

[BibT_eX]

[DOI]

Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Graph Exploration.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Algorithms for Hiring and Outsourcing in the Online Labor Market.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Prize Collecting Traveling Salesman and Related Problems.

[BibT_eX]

[DOI]

Giorgio Ausiello

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Sequential Posted-Price Mechanisms with Correlated Valuations.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

HALG: Highlights of Algorithms.

[BibT_eX]

[DOI]

Artur Czumaj

SIGACT News, 2017

Report on HALG 2016/2017.

[BibT_eX]

[DOI]

Artur Czumaj

Bull. EATCS, 2017

Fixed Price Approximability of the Optimal Gain from Trade.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

When the Optimum is also Blind: a New Perspective on Universal Optimization.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Flow Time Minimization.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Efficient computation of the Weighted Clustering Coefficient.

[BibT_eX]

[DOI]

Silvio Lattanzi

Internet Math., 2016

Online Network Design with Outliers.

[BibT_eX]

[DOI]

Algorithmica, 2016

Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.

[BibT_eX]

[DOI]

Qiang Zhang

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Bidding Strategies for Fantasy-Sports Auctions.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Approximately Efficient Double Auctions with Strong Budget Balance.

[BibT_eX]

[DOI]

Bart de Keijzer

Stefano Turchetta

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

Network-Aware Recommendations of Novel Tweets.

[BibT_eX]

[DOI]

Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Lottery Pricing Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Community Detection on Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Reservation Exchange Markets for Internet Advertising.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Stochastic Query Covering for Fast Approximate Document Retrieval.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2015

On Multiple Keyword Sponsored Search Auctions with Budgets.

[BibT_eX]

[DOI]

Monika Henzinger

Martin Starnberger

ACM Trans. Economics and Comput., 2015

Efficient cost-sharing mechanisms for prize-collecting problems.

[BibT_eX]

[DOI]

Math. Program., 2015

Robust Hierarchical k-Center Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects.

[BibT_eX]

[DOI]

Aris Anagnostopoulos

Diodato Ferraioli

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Utilitarian Mechanism Design for Multiobjective Optimization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Web and Social Graph Mining.

[BibT_eX]

[DOI]

Paolo Boldi

Cecilia Mascolo

Michalis Vazirgiannis

IEEE Internet Comput., 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.

[BibT_eX]

[DOI]

Piotr Sankowski

Qiang Zhang

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Preface.

[BibT_eX]

[DOI]

Camil Demetrescu

Theor. Comput. Sci., 2013

Set Covering with Our Eyes Closed.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Near-optimal multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Algorithms for Auctions and Games.

[BibT_eX]

[DOI]

Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012

Game-theoretic analysis of Internet switching with selfish users.

[BibT_eX]

[DOI]

Alexander Kesselman

Theor. Comput. Sci., 2012

Near-Optimal Multi-Unit Auctions with Ordered Bidders

[BibT_eX]

[DOI]

Elias Koutsoupias

Tim Roughgarden

CoRR, 2012

A Mazing 2+eps Approximation for Unsplittable Flow on a Path

[BibT_eX]

[DOI]

CoRR, 2012

Online team formation in social networks.

[BibT_eX]

[DOI]

Proceedings of the 21st World Wide Web Conference 2012, 2012

Prior-free auctions with ordered bidders.

[BibT_eX]

[DOI]

Tim Roughgarden

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

On Multiple Round Sponsored Search Auctions with Budgets

[BibT_eX]

[DOI]

Monika Henzinger

Martin Starnberger

CoRR, 2011

Stochastic query covering.

[BibT_eX]

[DOI]

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Single valued combinatorial auctions with budgets.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Approximation Algorithms for Union and Intersection Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Fully decentralized computation of aggregates over data streams.

[BibT_eX]

[DOI]

SIGKDD Explor., 2010

Strict Cost Sharing Schemes for Steiner Forest.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Combinatorial Auctions with Budgets

[BibT_eX]

[DOI]

CoRR, 2010

Utilitarian Mechanism Design for Multi-Objective Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

10211 Abstracts Collection - Flexible Network Design.

[BibT_eX]

[DOI]

Proceedings of the Flexible Network Design, 24.05. - 28.05.2010, 2010

Power in unity: forming teams in large-scale community systems.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2008

Flow Time Minimization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Link analysis for Web spam detection.

[BibT_eX]

[DOI]

ACM Trans. Web, 2008

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game.

[BibT_eX]

[DOI]

Jochen Könemann

Stefan H. M. van Zwam

SIAM J. Comput., 2008

Stochastic analyses for online combinatorial optimization problems.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Mining Large Networks with Subgraph Counting.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007

Prize-Collecting Traveling Salesman and Related Problems.

[BibT_eX]

[DOI]

Giorgio Ausiello

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

The Web as a graph: How far we are.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2007

Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Cut problems in graphs with a budget constraint.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Approximating total flow time on parallel machines.

[BibT_eX]

[DOI]

Danny Raz

J. Comput. Syst. Sci., 2007

Stability and Similarity of Link Analysis Ranking Algorithms.

[BibT_eX]

[DOI]

Debora Donato

Panayiotis Tsaparas

Internet Math., 2007

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Network formation games with local coalitions.

[BibT_eX]

[DOI]

Piotr Sankowski

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Pricing Tree Access Networks with Connected Backbones.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Estimating Clustering Indexes in Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

New Metrics for Reputation Management in P2P Networks.

[BibT_eX]

[DOI]

Proceedings of the AIRWeb 2007, 2007

2006

A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

A reference collection for web spam.

[BibT_eX]

[DOI]

SIGIR Forum, 2006

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.

[BibT_eX]

[DOI]

Yair Bartal

Amos Fiat

SIAM J. Comput., 2006

Design of trees in the hose model: The balanced case.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Gianpaolo Oriolo

Oper. Res. Lett., 2006

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

[BibT_eX]

[DOI]

Tjark Vredeveld

Math. Oper. Res., 2006

Algorithms and Experiments for the Webgraph.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Online weighted flow time and deadline scheduling.

[BibT_eX]

[DOI]

Vito Domenico Pietro Servedio

J. Discrete Algorithms, 2006

Preferential attachment in the growth of social networks: the case of Wikipedia

[BibT_eX]

[DOI]

Andrea Capocci

CoRR, 2006

Temporal Analysis of the Wikigraph.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 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

On the Value of Preemption in Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

Link-Based Characterization and Detection of Web Spam.

[BibT_eX]

[DOI]

Ricardo A. Baeza-Yates

Proceedings of the AIRWeb 2006, 2006

2005

Parallel scheduling problems in next generation wireless networks.

[BibT_eX]

[DOI]

Suhas N. Diggavi

S. Muthukrishnan

Thyagarajan Nandagopal

Networks, 2005

Special Issue on Algorithms and Models for the Web-Graph.

[BibT_eX]

[DOI]

Dimitris Achlioptas

Internet Math., 2005

Game-Theoretic Analysis of Internet Switching with Selfish Users.

[BibT_eX]

[DOI]

Alexander Kesselman

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Mining the inner structure of the Web graph.

[BibT_eX]

Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), 2005

A group-strategyproof mechanism for Steiner forests.

[BibT_eX]

[DOI]

Jochen Könemann

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.

[BibT_eX]

[DOI]

Jochen Könemann

Stefan H. M. van Zwam

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Dorothea Wagner

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

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

[BibT_eX]

[DOI]

Tjark Vredeveld

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

The Self-Star Vision.

[BibT_eX]

[DOI]

Aad P. A. van Moorsel

Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004

Cross-monotonic cost sharing methods for connected facility location games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Semi-clairvoyant scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Average stretch without migration.

[BibT_eX]

[DOI]

S. Muthukrishnan

J. Comput. Syst. Sci., 2004

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.

[BibT_eX]

[DOI]

J. ACM, 2004

Simulating the Webgraph: a comparative analysis of models.

[BibT_eX]

[DOI]

Comput. Sci. Eng., 2004

Preface.

[BibT_eX]

[DOI]

Algorithmica, 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

Scheduling multicasts on unit-capacity trees and meshes.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

J. Comput. Syst. Sci., 2003

Scheduling to Minimize Flow Time Metrics.

[BibT_eX]

[DOI]

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

Algorithms and Experiments for the Webgraph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Minimizing the Flow Time Without Migration.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

A Multi-Layer Model for the Web Graph.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Web Dynamics, 2002

An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.

[BibT_eX]

[DOI]

Massimiliano Curcio

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Preface.

[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

On-Line Competitive Algorithms for Call Admission in Optical Networks.

[BibT_eX]

[DOI]

Algorithmica, 2001

Algorithms for the On-Line Travelling Salesman.

[BibT_eX]

[DOI]

Algorithmica, 2001

Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Multiprocessor Scheduling with Rejection.

[BibT_eX]

[DOI]

Yair Bartal

Jirí Sgall

Leen Stougie

SIAM J. Discret. Math., 2000

Minimizing stall time in single and parallel disk systems.

[BibT_eX]

[DOI]

Susanne Albers

Naveen Garg

J. ACM, 2000

Scheduling to minimize average stretch without migration.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 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

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

[BibT_eX]

[DOI]

Giorgio Ausiello

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

1999

On-Line Routing in All-Optical Networks.

[BibT_eX]

[DOI]

Yair Bartal

Theor. Comput. Sci., 1999

On-line Algorithms.

[BibT_eX]

[DOI]

Susanne Albers

ACM Comput. Surv., 1999

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

[BibT_eX]

[DOI]

Algorithmica, 1999

On Capital Investment.

[BibT_eX]

[DOI]

Algorithmica, 1999

1998

Efficient Token-Based Control in Rings.

[BibT_eX]

[DOI]

Esteban Feuerstein

Nicola Santoro

Inf. Process. Lett., 1998

Randomized Lower Bounds for Online Path Coloring.

[BibT_eX]

[DOI]

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

1997

On scheduling variable length broadcasts in wireless networks.

[BibT_eX]

[DOI]

Maurizio A. Bonuccelli

Telecommun. Syst., 1997

1996

Enclosing a Set of Objects by Two Minimum Area Rectangles.

[BibT_eX]

[DOI]

Bruno Becker

Paolo Giulio Franciosa

J. Algorithms, 1996

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.

[BibT_eX]

[DOI]

Paola Alimonti

RAIRO Theor. Informatics Appl., 1996

Efficient Token-Based Control in Rings (Abstract).

[BibT_eX]

[DOI]

Esteban Feuerstein

Nicola Santoro

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

On-line Competive Algorithms for Call Admission in Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

On-line Network Routing.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

1995

Competitive Algorithms for the On-line Traveling Salesman.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 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

Serving Requests with On-line Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1993

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.

[BibT_eX]

[DOI]

Paola Alimonti