Mingyu Xiao

Theor. Comput. Sci., February, 2024

Networked Combinatorial Auction for Crowdsourcing and Crowdsensing.

[BibT_eX]

[DOI]

IEEE Internet Things J., February, 2024

An Improved Approximation Algorithm for Metric Triangle Packing.

[BibT_eX]

[DOI]

CoRR, 2024

Improved Approximation Algorithms for Cycle and Path Packings.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem.

[BibT_eX]

[DOI]

Lu Liu

Yi Zhou

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

2023

A parameterized algorithm for subset feedback vertex set in tournaments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., October, 2023

Further improvements for SAT in terms of formula length.

[BibT_eX]

[DOI]

Junqiang Peng

Inf. Comput., October, 2023

Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes.

[BibT_eX]

[DOI]

Binglin Tao

IEEE Trans. Netw. Serv. Manag., September, 2023

A 5k-vertex kernel for 3-path vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., May, 2023

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., May, 2023

The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles.

[BibT_eX]

[DOI]

Yuhao Liu

Discret. Math., April, 2023

Upper and lower bounds on approximating weighted mixed domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Listing maximal k-relaxed-vertex connected components from large graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2023

Two new algorithms for solving Müller games and their applications.

[BibT_eX]

[DOI]

Zihui Liang

Bakh Khoussainov

CoRR, 2023

A 5-approximation Algorithm for the Traveling Tournament Problem.

[BibT_eX]

[DOI]

CoRR, 2023

The APX-hardness of the Traveling Tournament Problem.

[BibT_eX]

[DOI]

CoRR, 2023

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching.

[BibT_eX]

[DOI]

Yuxi Liu

CoRR, 2023

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap.

[BibT_eX]

[DOI]

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

Fast Algorithms for SAT with Bounded Occurrences of Variables.

[BibT_eX]

[DOI]

Junqiang Peng

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

Connectivity in the Presence of an Opponent.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Characterizations of Network Auctions and Generalizations of VCG.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Multi-Unit Auction over a Social Network.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs.

[BibT_eX]

[DOI]

Kangyi Tian

Boting Yang

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results.

[BibT_eX]

[DOI]

Guoliang Qiu

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

Facility Location Games with Entrance Fees.

[BibT_eX]

[DOI]

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

The Linear Distance Traveling Tournament Problem Allows an EPTAS.

[BibT_eX]

[DOI]

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

2022

An improved kernel for planar vertex-disjoint triangle packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Parameterized algorithms and complexity for the traveling purchaser problem and its variants.

[BibT_eX]

[DOI]

Jianan Zhang

J. Comb. Optim., 2022

A simple and improved parameterized algorithm for bicluster editing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

An effective branch-and-bound algorithm for the maximum s-bundle problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two.

[BibT_eX]

[DOI]

CoRR, 2022

Breaking the Barrier 2k for Subset Feedback Vertex Set in Chordal Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity.

[BibT_eX]

[DOI]

CoRR, 2022

Facility Location with Entrance Fees.

[BibT_eX]

[DOI]

CoRR, 2022

Listing Maximal k-Plexes in Large Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Improved Approximation Algorithms for the Traveling Tournament Problem.

[BibT_eX]

[DOI]

Chao Xu

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2022, 2022

An Exact MaxSAT Algorithm: Further Observations and Further Improvements.

[BibT_eX]

[DOI]

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

Multi-Unit Auction in Social Networks with Budgets.

[BibT_eX]

[DOI]

Yuchao Song

Bakh Khoussainov

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

A Guide to Graph Algorithms

[BibT_eX]

[DOI]

Ton Kloks

Springer, ISBN: 978-981-16-6349-9, 2022

2021

An improved upper bound for SAT.

[BibT_eX]

[DOI]

Huairui Chu

Zhe Zhang

Theor. Comput. Sci., 2021

Exact algorithms for maximum weighted independent set on sparse graphs.

[BibT_eX]

[DOI]

Xiaoyu Chen

CoRR, 2021

Computing maximum k-defective cliques in massive graphs.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set.

[BibT_eX]

[DOI]

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

A Fast Algorithm for SAT in Terms of Formula Length.

[BibT_eX]

[DOI]

Junqiang Peng

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

A Further Improvement on Approximating TTP-2.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Xiaoyu Chen

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Enhancing Balanced Graph Edge Partition with Effective Local Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Multi-View Video Synopsis via Simultaneous Object-Shifting and View-Switching Optimization.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2020

Improved parameterized algorithms and kernels for mixed domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Parameterized algorithms and kernels for almost induced matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Video super-resolution via pre-frame constrained and deep-feature enhanced sparse reconstruction.

[BibT_eX]

[DOI]

Pattern Recognit., 2020

Some reduction operations to pairwise compatibility graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Bounded-Degree Cut is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2020

Characterizing Star-PCGs.

[BibT_eX]

[DOI]

Algorithmica, 2020

Object reachability via swaps under strict and weak preferences.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

The Complexity of the Partition Coloring Problem.

[BibT_eX]

[DOI]

Zhenyu Guo

Yi Zhou

Proceedings of the Theory and Applications of Models of Computation, 2020

Enumerating Maximal k-Plexes with Worst-Case Time Guarantee.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Algorithms for Manipulating Sequential Allocation.

[BibT_eX]

[DOI]

Jiaxing Ling

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes.

[BibT_eX]

[DOI]

Binglin Tao

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Frontiers in Algorithmics.

[BibT_eX]

[DOI]

Frances A. Rosamond

Theor. Comput. Sci., 2019

A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Computing lower bounds for minimum sum coloring and optimum cost chromatic partition.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

Balanced Clustering: A Uniform Model and Fast Algorithm.

[BibT_eX]

[DOI]

Zhu He

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

Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints.

[BibT_eX]

[DOI]

Jianan Zhang

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Improved Parameterized Algorithms for Mixed Domination.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Object Reachability via Swaps along a Line.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

带权混合支配问题的近似算法研究 (Approximation Algorithm for Weighted Mixed Domination Problem).

[BibT_eX]

[DOI]

Jianan Zhang

计算机科学, 2018

Exact Algorithms and Complexity of Kidney Exchange.

[BibT_eX]

[DOI]

Xuanbei Wang

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Geometric Least Squares Method for Peer Assessment.

[BibT_eX]

[DOI]

Yuqing Wang

Binglin Tao

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Complexity and kernels for bipartition into degree-bounded induced graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Linear kernels for separating a graph into components of bounded size.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

On a generalization of Nemhauser and Trotter's local optimization theorem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

A refined algorithm for maximum independent set in degree-4 graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Exact algorithms for Maximum Induced Matching.

[BibT_eX]

[DOI]

Huan Tan

Inf. Comput., 2017

Exact algorithms for maximum independent set.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

Score Aggregation via Spectral Method.

[BibT_eX]

[DOI]

Yuqing Wang

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

A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis.

[BibT_eX]

[DOI]

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

2016

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

An exact algorithm for maximum independent set in degree-5 graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure.

[BibT_eX]

[DOI]

Algorithmica, 2016

Almost Induced Matching: Linear Kernels and Parameterized Algorithms.

[BibT_eX]

[DOI]

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

An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Linear-Time Algorithm for Integral Multiterminal Flows in Trees.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A Parameterized Algorithm for Bounded-Degree Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

An improved exact algorithm for undirected feedback vertex set.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Exact algorithms for dominating induced matching based on graph partition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.

[BibT_eX]

[DOI]

Jiong Guo

Algorithmica, 2015

An Improved Exact Algorithm for Maximum Induced Matching.

[BibT_eX]

[DOI]

Huan Tan

Proceedings of the Theory and Applications of Models of Computation, 2015

Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

A refined exact algorithm for Edge Dominating Set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

On the Exact Block Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Parameterized edge dominating set in graphs with degree bounded by 3.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

New parameterized algorithms for the edge dominating set problem.

[BibT_eX]

[DOI]

Ton Kloks

Sheung-Hung Poon

Theor. Comput. Sci., 2013

FPTASs for trimming weighted trees.

[BibT_eX]

[DOI]

Takuro Fukunaga

Theor. Comput. Sci., 2013

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2013

2012

An FPT algorithm for edge subset feedback edge set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

An Improved Exact Algorithm for TSP in Degree-4 Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

New parameterized algorithms for edge dominating set

[BibT_eX]

[DOI]

Ton Kloks

Sheung-Hung Poon

CoRR, 2011

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem.

[BibT_eX]

[DOI]

Leizhen Cai

Andrew Chi-Chih Yao

Algorithmica, 2011

Further Improvement on Maximum Independent Set in Degree-4 Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract).

[BibT_eX]

[DOI]

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

2010

Simple and Improved Parameterized Algorithms for Multiterminal Cuts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Finding minimum 3-way cuts in hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

FPTAS's for Some Cut Problems in Weighted Trees.

[BibT_eX]

[DOI]

Takuro Fukunaga

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

A Note on Vertex Cover in Graphs with Maximum Degree 3.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs

[BibT_eX]

[DOI]

CoRR, 2009

2008

Algorithms for graph multiway partition problems.

[BibT_eX]

[DOI]

PhD thesis, 2008

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

[BibT_eX]

[DOI]

Leizhen Cai

Andrew C. Yao

CoRR, 2008

An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Algorithms for Multiterminal Cuts.

[BibT_eX]

[DOI]