郭炅

2026

Committee Elections with Candidate Attribute Constraints

Displays (Guildford)

DOI

2026

Pareto optimal matching with multilayer preferences: How hard can it be?

Theoretical Computer Science

DOI

2026

Stable marriage in Euclidean space

Autonomous Agents and Multi-Agent Systems

DOI

2026

Parameterized Approximation Algorithms for Dominating Set and Power Dominating Set By Using Leafage

International Computing and Combinatorics Conference

DOI

2025

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

International Computing and Combinatorics Conference

DOI

2025

Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?

International Computing and Combinatorics Conference

DOI

2025

Assignments for Congestion-Averse Agents: Seeking Competitive and Envy-Free Solutions

Neural Information Processing Systems

DOI

2025

From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems

International Computing and Combinatorics Conference

DOI

2025

An FPT Factor-11 Approximation Algorithm for TSP

International Computing and Combinatorics Conference

DOI

2024

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes

arXiv.org

DOI

2023

Algorithms and Complexity for Congested Assignments

arXiv.org

DOI

2023

Stable Marriage in Euclidean Space

Adaptive Agents and Multi-Agent Systems

DOI

2023

Multi-winner Approval Voting with Grouped Voters

International Conference on Combinatorial Optimization and Applications

DOI

2022

Parameterized Approximation Algorithms for TSP

International Symposium on Algorithms and Computation

DOI

2022

Position-Based Matching with Multi-Modal Preferences

Adaptive Agents and Multi-Agent Systems

DOI

2022

Colorful Graph Coloring

Frontiers in Algorithmics

DOI

2022

Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules

Frontiers in Algorithmics

DOI

2021

Constrained Stable Marriage with Free Edges or Few Blocking Pairs

International Conference on Combinatorial Optimization and Applications

DOI

2020

Parameterized Complexity of Shift Bribery in Iterative Elections

Adaptive Agents and Multi-Agent Systems

DOI

2019

On the complexity of bribery with distance restrictions

Theoretical Computer Science

DOI

2019

Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes

Adaptive Agents and Multi-Agent Systems

DOI

2018

Foreword: Special Issue on Parameterized and Exact Computation

Algorithmica

DOI

2018

Parameterized Complexity of Voter Control in Multi-Peaked Elections

Theory of Computing Systems

DOI

2017

On the kernelization of split graph problems

Theoretical Computer Science

DOI

2017

LIPIcs, Volume 63, IPEC'16, Complete Volume

2016

How Hard Is Bribery with Distance Restrictions?

European Conference on Artificial Intelligence

DOI

2016

Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors

International Symposium on Parameterized and Exact Computation

DOI

2016

Parameterized Complexity of Winner Determination in Minimax Committee Elections

Adaptive Agents and Multi-Agent Systems

DOI

2016

Kernelization of Two Path Searching Problems on Split Graphs

Frontiers in Algorithmics

DOI

2016

Possible winner problems on partial tournaments: a parameterized study

Journal of combinatorial optimization

DOI

2015

How Hard is Control in Multi-Peaked Elections: A Parameterized Study

Adaptive Agents and Multi-Agent Systems

DOI

2015

How Hard is Bribery in Party Based Elections?

Adaptive Agents and Multi-Agent Systems

DOI

2015

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs

Journal of combinatorial optimization

DOI

2014

An Overview of Kernelization Algorithms for Graph Modification Problems

DOI

2014

Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges

Tsinghua Science and Technology

2014

How Credible is the Prediction of a Party-Based Election?

Adaptive Agents and Multi-Agent Systems

DOI

2014

Parameterized Complexity of Edge Interdiction Problems

International Computing and Combinatorics Conference

DOI

2014

The control complexity of r-Approval: From the single-peaked case to the general case

Journal of computer and system sciences (Print)

DOI

2014

On Star-Cover and Path-Cover of a Tree

Frontiers in Algorithmics

DOI

2014

Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

J. Graph Algorithms Appl.

DOI

2014

Controlling Two-Stage Voting Rules

European Conference on Artificial Intelligence

DOI

2014

Controlling elections with bounded single-peaked width

Adaptive Agents and Multi-Agent Systems

DOI

2013

Exact algorithms for weighted and unweighted Borda manipulation problems

Theoretical Computer Science

DOI

2013

Parameterized complexity of control and bribery for d-approval elections

Theoretical Computer Science

DOI

2013

Improved linear problem kernel for planar connected dominating set

Theoretical Computer Science

DOI

2013

Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections

arXiv.org

2013

An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs

International Computing and Combinatorics Conference

DOI

2013

Planar graph vertex partition for linear problem kernels

Journal of computer and system sciences (Print)

DOI

2013

Covering tree with stars

Journal of combinatorial optimization

DOI

2012

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments

Algorithmica

DOI

2012

Complexity and parameterized algorithms for Cograph Editing

Theoretical Computer Science

DOI

2012

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)

Dagstuhl Reports

DOI

2012

Kernelization and Parameterized Complexity of Star Editing and Union Editing

International Symposium on Algorithms and Computation

DOI

2011

The Parameterized Complexity of Local Search for TSP, More Refined

Algorithmica

DOI

2011

An Improved Kernel for Planar Connected Dominating Set

Theory and Applications of Models of Computation

DOI

2011

Linear Problem Kernels for Planar Graph Problems with Small Distance Property

International Symposium on Mathematical Foundations of Computer Science

DOI

2011

Cograph Editing: Complexity and Parameterized Algorithms

International Computing and Combinatorics Conference

DOI

2011

Safe Approximation and Its Relation to Kernelization

International Symposium on Parameterized and Exact Computation

DOI

2010

Simultaneous embeddings of graphs as median and antimedian subgraphs

DOI

2010

Average parameterization and partial kernelization for computing medians

Journal of computer and system sciences (Print)

DOI

2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of computer and system sciences (Print)

DOI

2009

A generalization of Nemhauser and Trotterʼs local optimization theorem

Journal of computer and system sciences (Print)

DOI

2009

Editing Graphs into Disjoint Unions of Dense Clusters

Algorithmica

DOI

2009

Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science

DOI

2009

What Makes Equitable Connected Partition Easy

IWPEC

DOI

2009

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

TOCT

DOI

2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks

DOI

2009

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

SIAM Journal on Discrete Mathematics

DOI

2009

The parameterized complexity of some minimum label problems

Journal of computer and system sciences (Print)

DOI

2009

How similarity helps to efficiently compute Kemeny rankings

Adaptive Agents and Multi-Agent Systems

DOI

2009

Data reduction and exact algorithms for clique cover

JEAL

DOI

2008

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

European Journal Of Operational Research，Vol. 186, No. 2

DOI

2008

Computing Kemeny rankings, parameterized by the average K-T distance

2008

Parameterized computational complexity of Dodgson and Young elections

Information and Computation

DOI

2008

Closest 4-leaf power is fixed-parameter tractable

Discrete Applied Mathematics

DOI

2008

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees

Information Processing Letters

DOI

2008

Undirected Feedback Vertex Set

Encyclopedia of Algorithms

DOI

2008

Fixed-Parameter Algorithms for Kemeny Scores

Algorithmic Applications in Management

DOI

2008

Red-blue covering problems and the consecutive ones property

J. Discrete Algorithms

DOI

2007

A more effective linear kernelization for cluster editing

Theoretical Computer Science

DOI

2007

Kernelization and complexity results for connectivity augmentation problems

Networks

DOI

2007

Probe Matrix Problems: Totally Balanced Matrices

Algorithmic Applications in Management

DOI

2007

Parameterized Complexity of Vertex Cover Variants

Theory of Computing Systems

DOI

2007

Invitation to data reduction and problem kernelization

SIGA

DOI

2007

News Complexity Theory Column 54

2007

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

Theory and Applications of Models of Computation

DOI

2007

Linear Problem Kernels for NP-Hard Problems on Planar Graphs

International Colloquium on Automata, Languages and Programming

DOI

2007

Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs

International Symposium on Algorithms and Computation

DOI

2007

Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters

DOI

2006

Error Compensation in Leaf Power Problems

Algorithmica

DOI

2006

Fixed-parameter tractability results for feedback set problems in tournaments

J. Discrete Algorithms

DOI

2006

Open Problems in Parameterized and Exact Computation - IWPEC 2006

2006

Complexity and Exact Algorithms for Multicut

Conference on Current Trends in Theory and Practice of Informatics

DOI

2006

Algorithm design techniques for parameterized graph modification problems

Ausgezeichnete Informatikdissertationen

2006

Minimum Membership Set Covering and the Consecutive Ones Property

Scandinavian Workshop on Algorithm Theory

DOI

2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions

International Journal of Foundations of Computer Science

DOI

2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

Workshop on Algorithm Engineering and Experimentation

DOI

2006

Parameterized Intractability of Distinguishing Substring Selection

Theory of Computing Systems

DOI

2006

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of computer and system sciences (Print)

DOI

2006

Exact algorithms and applications for Tree-like Weighted Set Cover

J. Discrete Algorithms

DOI

2006

A fixed-parameter tractability result for multicommodity demand flow in trees

Information Processing Letters

DOI

2006

Fixed‐parameter tractability results for full‐degree spanning tree and its dual

Networks

DOI

2005

Improved Algorithms and Complexity Results for Power Domination in Graphs

Algorithmica

DOI

2005

Parameterized Complexity of Generalized Vertex Cover Problems

Workshop on Algorithms and Data Structures

DOI

2005

Exact Algorithms for Generalizations of Vertex Cover

2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

Workshop on Algorithms and Data Structures

DOI

2005

Extending the Tractability Border for Closest Leaf Powers

International Workshop on Graph-Theoretic Concepts in Computer Science

DOI

2005

Bounded Degree Closest k-Tree Power Is NP-Complete

International Computing and Combinatorics Conference

DOI

2005

Fixed‐parameter tractability and data reduction for multicut in trees

Networks

DOI

2004

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Algorithmica

DOI

2004

Error Compensation in Leaf Root Problems

International Symposium on Algorithms and Computation

DOI

2004

Avoiding Forbidden Submatrices by Row Deletions

Conference on Current Trends in Theory and Practice of Informatics

DOI

2004

A Structural View on Parameterizing Problems: Distance from Triviality

IWPEC

DOI

2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems

Embedded Systems and Applications

DOI

2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection

International Symposium on Fundamentals of Computation Theory

DOI

2026

Parameterized Approximation Algorithms for Minimum Weighted Connected Dominating Set and Connected α-Dominating Function

SSRN Electronic Journal

DOI