Ioannis Caragiannis

Anders Bo Ipsen

Alexander Søltoft

CoRR, August, 2025

Rethinking Pricing in Energy Markets: Pay-as-Bid vs Pay-as-Clear.

[BibT_eX]

[DOI]

Stratis Skoulakis

CoRR, July, 2025

Quantile agent utility and implications to randomized social choice.

[BibT_eX]

[DOI]

Sanjukta Roy

CoRR, February, 2025

Mechanisms for Selling an Item Among a Strategic Bidder and a Profiled Agent.

[BibT_eX]

[DOI]

Georgios Kalantzis

CoRR, February, 2025

A new lower bound for multi-color discrepancy with applications to fair division.

[BibT_eX]

[DOI]

Kasper Green Larsen

Sudarshan Shyam

CoRR, February, 2025

A New Lower Bound for Multicolor Discrepancy with Applications to Fair Division.

[BibT_eX]

[DOI]

Kasper Green Larsen

Sudarshan Shyam

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Nidhi Rathi

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Truthful ownership transfer with expert advice.

[BibT_eX]

[DOI]

Swaprava Nath

Math. Program., January, 2024

On the satisfiability of random 3-SAT formulas with <i>k</i>-wise independent clauses.

[BibT_eX]

[DOI]

CoRR, 2024

An impossibility result for strongly group-strategyproof multi-winner approval-based voting.

[BibT_eX]

[DOI]

Rob LeGrand

Evangelos Markakis

Emmanouil Pountourakis

CoRR, 2024

Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship.

[BibT_eX]

[DOI]

Sebastian Homrighausen

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Proportional Fairness in Non-Centroid Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Randomized Learning-Augmented Auctions with Revenue Guarantees.

[BibT_eX]

[DOI]

Georgios Kalantzis

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Can a Few Decide for Many? The Metric Distortion of Sortition.

[BibT_eX]

[DOI]

Jannik Peters

Proceedings of the Forty-first International Conference on Machine Learning, 2024

On the Complexity of Pareto-Optimal and Envy-Free Lotteries.

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

Nidhi Rathi

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Low-Distortion Clustering with Ordinal and Limited Cardinal Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Beyond the worst case: Distortion in impartial culture electorate.

[BibT_eX]

[DOI]

Karl Fehrs

CoRR, 2023

Impartial Selection with Prior Information.

[BibT_eX]

[DOI]

George Christodoulou

Nicos Protopapas

Proceedings of the ACM Web Conference 2023, 2023

Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Optimizing over Serial Dictatorships.

[BibT_eX]

[DOI]

Nidhi Rathi

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Repeatedly Matching Items to Agents Fairly and Efficiently.

[BibT_eX]

[DOI]

Shivika Narang

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Outsourcing Adjudication to Strategic Jurors.

[BibT_eX]

[DOI]

Nikolaj I. Schwartzbach

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

New Fairness Concepts for Allocating Indivisible Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Information Networking, 2023

2022

Adjudication with Rational Jurors.

[BibT_eX]

[DOI]

Nikolaj I. Schwartzbach

CoRR, 2022

Bounding the Inefficiency of Compromise in Opinion Formation.

[BibT_eX]

[DOI]

Algorithmica, 2022

Beyond Cake Cutting: Allocating Homogeneous Divisible Goods.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

A Little Charity Guarantees Fair Connected Graph Partitioning.

[BibT_eX]

[DOI]

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

The Complexity of Learning Approval-Based Multiwinner Voting Rules.

[BibT_eX]

[DOI]

Karl Fehrs

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

The Metric Distortion of Multiwinner Voting.

[BibT_eX]

[DOI]

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

Truthful Aggregation of Budget Proposals with Proportionality Guarantees.

[BibT_eX]

[DOI]

George Christodoulou

Nicos Protopapas

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

2021

Computing Envy-Freeable Allocations with Limited Subsidies.

[BibT_eX]

[DOI]

Stavros Ioannidis

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

Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching.

[BibT_eX]

[DOI]

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

On Interim Envy-Free Allocation Lotteries.

[BibT_eX]

[DOI]

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

2020

Simple posted pricing mechanisms for selling a divisible item.

[BibT_eX]

[DOI]

Apostolis Kerentzis

CoRR, 2020

Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Impartial Selection with Additive Approximation Guarantees.

[BibT_eX]

[DOI]

George Christodoulou

Nicos Protopapas

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Almost Envy-Free Allocations with Connected Bundles.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Deanonymizing Social Networks Using Structural Information.

[BibT_eX]

[DOI]

Evanthia Tsitsoka

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

A Contribution to the Critique of Liquid Democracy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Portioning Using Ordinal Preferences: Fairness and Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Fair Allocation of Indivisible Goods and Chores.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies.

[BibT_eX]

[DOI]

Angelo Fanelli

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

Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items.

[BibT_eX]

[DOI]

Xin Huang

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

Stable Fractional Matchings.

[BibT_eX]

[DOI]

Rohit Vaish

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

2018

Fair allocation of combinations of indivisible goods and chores.

[BibT_eX]

[DOI]

Haris Aziz

Ayumi Igarashi

CoRR, 2018

Truthful mechanisms for ownership transfer with expert advice.

[BibT_eX]

[DOI]

Swaprava Nath

CoRR, 2018

The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users.

[BibT_eX]

[DOI]

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

Knowledge, Fairness, and Social Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Cosimo Vinci

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

Information Retention in Heterogeneous Majority Dynamics.

[BibT_eX]

[DOI]

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

Opting Into Optimal Matchings.

[BibT_eX]

[DOI]

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

Learning a Ground Truth Ranking Using Noisy Approval Votes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Bounding the Inefficiency of Compromise.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

[BibT_eX]

[DOI]

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

Robustness in Discrete Preference Games.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Optimizing Positional Scoring Rules for Rank Aggregation.

[BibT_eX]

[DOI]

Xenophon Chatzigeorgiou

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Dodgson's Rule and Young's Rule.

[BibT_eX]

[DOI]

Edith Hemaspaandra

Lane A. Hemaspaandra

Proceedings of the Handbook of Computational Social Choice, 2016

Discrete Preference Games in Heterogeneous Social Networks: Subverted Majorities and the Swing Player.

[BibT_eX]

[DOI]

CoRR, 2016

Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship.

[BibT_eX]

[DOI]

Søren Kristoffer Stiil Frederiksen

Kristoffer Arnsfelt Hansen

Zihan Tan

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

How Effective Can Simple Ordinal Peer Grading Be?

[BibT_eX]

[DOI]

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

The Unreasonable Fairness of Maximum Nash Welfare.

[BibT_eX]

[DOI]

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

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling.

[BibT_eX]

[DOI]

Angelo Fanelli

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Subset Selection via Implicit Utilitarian Voting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Achieving Proportional Representation in Conference Programs.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Generalized Discrete Preference Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Truthful Univariate Estimators.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers.

[BibT_eX]

[DOI]

Marianna Panteli

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

An Algorithmic Framework for Strategic Fair Division.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Bounding the inefficiency of outcomes in generalized second price auctions.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

Minority Becomes Majority in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Near-Optimal Asymmetric Binary Matrix Partitions.

[BibT_eX]

[DOI]

Fidaa Abed

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Efficiency and Complexity of Price Competition Among Single-Product Vendors.

[BibT_eX]

[DOI]

Xenophon Chatzigeorgiou

Nikos Protopapas

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Aggregating Partial Rankings with Applications to Peer Grading in Massive Online Open Courses.

[BibT_eX]

[DOI]

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

2014

Revenue Guarantees in the Generalized Second Price Auction.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2014

Discrete preference games: social influence through coordination, and beyond.

[BibT_eX]

[DOI]

CoRR, 2014

Welfare Guarantees for Proportional Allocations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games.

[BibT_eX]

[DOI]

Angelo Fanelli

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Modal Ranking: A Uniquely Robust Voting Rule.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Biased Games.

[BibT_eX]

[DOI]

David Kurokawa

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Tight approximation bounds for combinatorial frugal coverage algorithms.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Equilibria of Generalized Cut and Choose Protocols.

[BibT_eX]

[DOI]

CoRR, 2013

When do noisy votes reveal the truth?

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Limitations of Deterministic Auction Design for Correlated Bidders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

How Bad Is Selfish Voting?

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Computing approximate pure Nash equilibria in congestion games.

[BibT_eX]

[DOI]

SIGecom Exch., 2012

On the efficiency of equilibria in generalized second price auctions

[BibT_eX]

[DOI]

CoRR, 2012

Enforcing efficient equilibria in network design games via subsidies.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Space Lower Bounds for Low-Stretch Greedy Embeddings.

[BibT_eX]

[DOI]

Christos Kalaitzis

Proceedings of the Structural Information and Communication Complexity, 2012

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure.

[BibT_eX]

[DOI]

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

Mechanism design: from partial to probabilistic verification.

[BibT_eX]

[DOI]

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

Optimal social choice functions: a utilitarian view.

[BibT_eX]

[DOI]

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

Revenue Guarantees in Sponsored Search Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions

[BibT_eX]

[DOI]

CoRR, 2011

Efficient computation of approximate pure Nash equilibria

[BibT_eX]

[DOI]

CoRR, 2011

An Improved 2-Agent Kidney Exchange Mechanism.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

On the efficiency of equilibria in generalized second price auctions.

[BibT_eX]

[DOI]

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

Towards More Expressive Cake Cutting.

[BibT_eX]

[DOI]

John K. Lai

Proceedings of the IJCAI 2011, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Fractional Path Coloring in Bounded Degree Trees with Applications.

[BibT_eX]

[DOI]

Algorithmica, 2010

The Impact of Altruism on the Efficiency of Atomic Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Socially desirable approximations for Dodgson's voting rule.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Voting Almost Maximizes Social Welfare Despite Limited Communication.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Approximation Algorithms and Mechanism Design for Minimax Approval Voting.

[BibT_eX]

[DOI]

Dimitris Kalaitzis

Evangelos Markakis

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.

[BibT_eX]

[DOI]

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

Game-Theoretic Approaches to Optimization Problems in Communication Networks.

[BibT_eX]

[DOI]

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

2009

Analysis of Approximation Algorithms for <i>k</i>-Set Cover Using Factor-Revealing Linear Programs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

The Efficiency of Fair Division.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the approximability of Dodgson and Young elections.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Efficient coordination mechanisms for unrelated machine scheduling.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Energy-Efficient Communication in Multi-interface Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

An Improved Approximation Bound for Spanning Star Forest and Color Saving.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On Low-Envy Truthful Allocations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008

Competitive algorithms and lower bounds for online randomized call control in cellular networks.

[BibT_eX]

[DOI]

Networks, 2008

Improving the Efficiency of Load Balancing Games through Taxes.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Communication in wireless networks with directional antennas.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Better bounds for online load balancing on unrelated machines.

[BibT_eX]

[DOI]

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

A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.

[BibT_eX]

[DOI]

Gianpiero Monaco

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2008, 2008

2007

Online Call Admission Control in Wireless Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Minimum Energy Communication in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

A tight bound for online colouring of disk graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Wavelength Management in WDM Rings to Maximize the Number of Connections.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Michele Flammini

Luca Moscardelli

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Approximation Algorithms for Path Coloring in Trees.

[BibT_eX]

[DOI]

Giuseppe Persiano

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Scheduling to Maximize Participation.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Tight Bounds for Selfish and Greedy Load Balancing.

[BibT_eX]

[DOI]

Michele Flammini

Luca Moscardelli

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Taxes for Linear Atomic Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

A Tight Bound for Online Coloring of Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Network Load Games.

[BibT_eX]

[DOI]

Clemente Galdi

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Basic Computations in Wireless Networks.

[BibT_eX]

[DOI]

Clemente Galdi

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Geometric Clustering to Minimize the Sum of Cluster Sizes.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Algorithms, 2005

2004

Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Online Algorithms for Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003

A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Simple On-Line Algorithms for Call Control in Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Power Consumption Problems in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Energy-Efficient Wireless Network Design.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Efficient On-Line Frequency Allocation and Call Control in Cellular Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

New Results for Energy-Efficient Broadcasting in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Sparse and limited wavelength conversion in all-optical tree networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Wavelength Routing in All-optical Tree Networks: A Survey.

[BibT_eX]

[DOI]

Giuseppe Persiano

Comput. Artif. Intell., 2001

Approximate Constrained Bipartite Edge Coloring.

[BibT_eX]

[DOI]

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

New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

Competitive Analysis of On-line Randomized Call Control in Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Fractional Path Coloring with Applications to WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Symmetric Communication in All-Optical Tree Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Efficient on-line communication in cellular networks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Greedy Dynamic Hot-Potato Routing on Arrays.

[BibT_eX]

[DOI]

Ioannis Vergados

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note).

[BibT_eX]

[DOI]

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

Randomized path coloring on binary trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.

[BibT_eX]

[DOI]

Athanasios Bouganis

Proceedings of the Algorithm Engineering, 1999

Edge Coloring of Bipartite Graphs with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998

Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

On the Complexity of Wavelength Converters.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Efficient wavelength routing in trees with low-degree converters.

[BibT_eX]

[DOI]

Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

1997

Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.

[BibT_eX]

Proceedings of the SIROCCO'97, 1997

A general framework for applying safety analysis to safety critical real-time applications using fault trees.

[BibT_eX]

[DOI]

Vassilis C. Gerogiannis