Chien-Chung Huang

Algorithmica, November, 2024

Robust Sparsification for Matroid Intersection with Applications.

[BibT_eX]

[DOI]

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

An FPTAS for Connectivity Interdiction.

[BibT_eX]

[DOI]

Sorrachai Yingchareonthawornchai

Nidia Obscura Acosta

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Approximating Maximum Integral Multiflows on Bounded Genus Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective.

[BibT_eX]

[DOI]

Justin Ward

SIAM J. Discret. Math., June, 2023

Matroid-constrained vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

2022

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Vizing's and Shannon's Theorems for Defective Edge Colouring.

[BibT_eX]

[DOI]

Pierre Aboulker

Guillaume Aubian

Electron. J. Comb., 2022

Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.

[BibT_eX]

[DOI]

Parinya Chalermsook

Sorrachai Yingchareonthawornchai

Danupon Nanongkai

Thatchaphol Saranurak

Pattara Sukprasert

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Maximum Weight b-Matchings in Random-Order Streams.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Popularity, Mixed Matchings, and Self-Duality.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.

[BibT_eX]

[DOI]

Algorithmica, 2021

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

2020

FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives.

[BibT_eX]

[DOI]

Justin Ward

CoRR, 2020

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint.

[BibT_eX]

[DOI]

Yuichi Yoshida

Algorithmica, 2020

Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints.

[BibT_eX]

[DOI]

Theophile Thiery

Justin Ward

Proceedings of the Approximation, 2020

2019

Exact and approximation algorithms for weighted matroid intersection.

[BibT_eX]

[DOI]

Naoyuki Kamiyama

Math. Program., 2019

A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State.

[BibT_eX]

[DOI]

Antonios Antoniadis

Sebastian Ott

Algorithmica, 2019

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.

[BibT_eX]

[DOI]

Mathieu Mari

Claire Mathieu

Joseph S. B. Mitchell

Nabil H. Mustafa

Proceedings of the Approximation, 2019

Graph Matching, Matroid Intersection, and Beyond. (Couplage, L'Intersection de Matroïdes, et Au-Delà).

[BibT_eX]

[DOI]

, 2019

2017

Popular Matchings with Two-Sided Preferences and One-Sided Ties.

[BibT_eX]

[DOI]

Ágnes Cseh

SIAM J. Discret. Math., 2017

New Algorithms for Maximum Weight Matching and a Decomposition Theorem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds.

[BibT_eX]

[DOI]

Danupon Nanongkai

Thatchaphol Saranurak

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Hospitals/Residents Problems with Quota Lower Bounds.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fair Matchings and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2016

Priority Mutual Exclusion: Specification and Algorithm.

[BibT_eX]

[DOI]

Prasad Jayanti

Proceedings of the Distributed Computing - 30th International Symposium, 2016

A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges.

[BibT_eX]

[DOI]

Sebastian Ott

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Coordinating oligopolistic players in unrelated machine scheduling.

[BibT_eX]

[DOI]

Fidaa Abed

Theor. Comput. Sci., 2015

Improved approximation algorithms for two variants of the stable marriage problem with ties.

[BibT_eX]

[DOI]

Math. Program., 2015

On the Uniqueness of Equilibrium in Atomic Splittable Routing Games.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Maintaining Near-Popular Matchings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

2014

New Results for Non-Preemptive Speed Scaling.

[BibT_eX]

[DOI]

Sebastian Ott

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Optimal Coordination Mechanisms for Multi-job Scheduling Games.

[BibT_eX]

[DOI]

Fidaa Abed

José R. Correa

Proceedings of the Algorithms - ESA 2014, 2014

2013

Near-Popular Matchings in the Roommates Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Non-preemptive speed scaling.

[BibT_eX]

[DOI]

Antonios Antoniadis

J. Sched., 2013

Collusion in Atomic Splittable Routing Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Popular matchings in the stable marriage problem.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Donation Center Location Problem.

[BibT_eX]

[DOI]

Zoya Svitkina

Algorithmica, 2013

Parameterized Two-Player Nash Equilibrium.

[BibT_eX]

[DOI]

Algorithmica, 2013

How to Pack Your Items When You Have to Buy Your Knapsack.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Efficient algorithms for maximum weight matchings in general graphs with small edge weights.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Preemptive Coordination Mechanisms for Unrelated Machines.

[BibT_eX]

[DOI]

Fidaa Abed

Proceedings of the Algorithms - ESA 2012, 2012

2011

Bounded Unpopularity Matchings.

[BibT_eX]

[DOI]

Algorithmica, 2011

On Expressing Value Externalities in Position Auctions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Circular Stable Matching and 3-way Kidney Transplant.

[BibT_eX]

[DOI]

Algorithmica, 2010

Classified Stable Matching.

[BibT_eX]

[DOI]

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

Group mutual exclusion in O(log n) RMR.

[BibT_eX]

[DOI]

Vibhor Bhatt

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

The Price of Collusion in Series-Parallel Networks.

[BibT_eX]

[DOI]

Umang Bhaskar

Lisa Fleischer

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Equilibria of atomic flow games are not unique.

[BibT_eX]

[DOI]

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

2007

Cheating to Get Better Roommates in a Random Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Using Nash Implementation to Achieve Better Frugality Ratios.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Cheating by Men in the Gale-Shapley Stable Matching Algorithm.

[BibT_eX]

[DOI]