Jiong Guo

CoRR, 2023

Multi-winner Approval Voting with Grouped Voters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

Stable Marriage in Euclidean Space.

[BibT_eX]

[DOI]

Zhongyi Zhang

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

2022

Parameterized Approximation Algorithms for TSP.

[BibT_eX]

[DOI]

Jianqi Zhou

Peihua Li

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Colorful Graph Coloring.

[BibT_eX]

[DOI]

Zhongyi Zhang

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules.

[BibT_eX]

[DOI]

Peihua Li

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Position-Based Matching with Multi-Modal Preferences.

[BibT_eX]

[DOI]

Aizhong Zhou

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

2021

Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling.

[BibT_eX]

[DOI]

Deming Lei

Ming Li

J. Intell. Fuzzy Syst., 2021

Sorting a Permutation by Best Short Swaps.

[BibT_eX]

[DOI]

Algorithmica, 2021

Constrained Stable Marriage with Free Edges or Few Blocking Pairs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Parameterized Complexity of Shift Bribery in Iterative Elections.

[BibT_eX]

[DOI]

Aizhong Zhou

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

On the complexity of bribery with distance restrictions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Foreword: Special Issue on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Danny Hermelin

Algorithmica, 2019

A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes.

[BibT_eX]

[DOI]

Aizhong Zhou

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

On the kernelization of split graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Parameterized Complexity of Voter Control in Multi-Peaked Elections.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

An optimal algorithm for small group multicast in wireless sensor networks.

[BibT_eX]

[DOI]

Int. J. Ad Hoc Ubiquitous Comput., 2018

ID Repair for Trajectories with Transition Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

Can a permutation be sorted by best short swaps?.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

The Longest Common Exemplar Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Possible winner problems on partial tournaments: a parameterized study.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Undirected Feedback Vertex Set.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Exact algorithms for weighted and unweighted Borda manipulation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Kernelization of Two Path Searching Problems on Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

How Hard Is Bribery with Distance Restrictions?

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Parameterized Complexity of Winner Determination in Minimax Committee Elections.

[BibT_eX]

[DOI]

Hong Liu

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Parameterized complexity of control and bribery for d-approval elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Covering tree with stars.

[BibT_eX]

[DOI]

Rashid Ibragimov

J. Comb. Optim., 2015

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

[BibT_eX]

[DOI]

Mingyu Xiao

Algorithmica, 2015

How Hard is Bribery in Party Based Elections?

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2014

Algorithms for parameterized maximum agreement forest problem on multiple trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Local search for string problems: Brute-force is essentially optimal.

[BibT_eX]

[DOI]

Danny Hermelin

Theor. Comput. Sci., 2014

On the parameterized complexity of consensus clustering.

[BibT_eX]

[DOI]

Martin Dörnfelder

Mathias Weller

Theor. Comput. Sci., 2014

Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

[BibT_eX]

[DOI]

CoRR, 2014

Design Tutoring Feedback to Increase Online Learners' Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Emerging Issues in Smart Learning, 2014

Multiple graph edit distance: simultaneous topological alignment of multiple protein-protein interaction networks with an evolutionary algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Efficient Large-scale bicluster editing.

[BibT_eX]

[DOI]

Peng Sun

Proceedings of the German conference on bioinformatics 2014, September 28, 2014

On Star-Cover and Path-Cover of a Tree.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Controlling Two-Stage Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Compactness-Preserving Mapping on Trees.

[BibT_eX]

[DOI]

Rashid Ibragimov

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Complexity of Dense Bicluster Editing Problems.

[BibT_eX]

[DOI]

Peng Sun

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Parameterized Complexity of Edge Interdiction Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Controlling elections with bounded single-peaked width.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Parameterized complexity of Min-power multicast problems in wireless ad hoc networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Improved linear problem kernel for planar connected dominating set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Planar graph vertex partition for linear problem kernels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

The Parameterized Complexity of Local Search for TSP, More Refined.

[BibT_eX]

[DOI]

Algorithmica, 2013

Neighborhood-Preserving Mapping between Trees.

[BibT_eX]

[DOI]

Rashid Ibragimov

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

NABEECO: biological network alignment with bee colony optimization algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment.

[BibT_eX]

[DOI]

Proceedings of the German Conference on Bioinformatics 2013, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Parameterized Complexity of Control and Bribery for d-Approval Elections.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Complexity and parameterized algorithms for Cograph Editing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Integrated simultaneous analysis of different biomedical data types with exact weighted bi-cluster editing.

[BibT_eX]

[DOI]

Peng Sun

J. Integr. Bioinform., 2012

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

Kernelization and Parameterized Complexity of Star Editing and Union Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2011

Parameterized Complexity of Arc-Weighted Directed Steiner Problems.

[BibT_eX]

[DOI]

Ondrej Suchý

SIAM J. Discret. Math., 2011

A generalization of Nemhauser and Trotterʼs local optimization theorem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Average parameterization and partial kernelization for computing medians.

[BibT_eX]

[DOI]

Nadja Betzler

J. Comput. Syst. Sci., 2011

Graph-based data clustering with overlaps.

[BibT_eX]

[DOI]

Michael R. Fellows

Discret. Optim., 2011

Editing Graphs into Disjoint Unions of Dense Clusters.

[BibT_eX]

[DOI]

Iyad A. Kanj

Algorithmica, 2011

An Improved Kernel for Planar Connected Dominating Set.

[BibT_eX]

[DOI]

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

Linear Problem Kernels for Planar Graph Problems with Small Distance Property.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Safe Approximation and Its Relation to Kernelization.

[BibT_eX]

[DOI]

Iyad A. Kanj

Stefan Kratsch

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Cograph Editing: Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View.

[BibT_eX]

[DOI]

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

2010

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Kernelization and complexity results for connectivity augmentation problems.

[BibT_eX]

[DOI]

Networks, 2010

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

[BibT_eX]

[DOI]

Sebastian Wernicke

Networks, 2010

Fixed-parameter tractability results for feedback set problems in tournaments.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

The parameterized complexity of some minimum label problems.

[BibT_eX]

[DOI]

Michael R. Fellows

Iyad A. Kanj

J. Comput. Syst. Sci., 2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.

[BibT_eX]

[DOI]

Michael Dom

J. Comput. Syst. Sci., 2010

Parameterized computational complexity of Dodgson and Young elections.

[BibT_eX]

[DOI]

Nadja Betzler

Inf. Comput., 2010

Extended Islands of Tractability for Parsimony Haplotyping.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Exact Algorithms and Experiments for Hierarchical Tree Clustering.

[BibT_eX]

[DOI]

Sepp Hartung

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

2009

A more effective linear kernelization for cluster editing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Fixed-Parameter Algorithms for Graph-Modeled Date Clustering.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

What Makes Equitable Connected Partition Easy.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems.

[BibT_eX]

[DOI]

Hannes Moser

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

How similarity helps to efficiently compute Kemeny rankings.

[BibT_eX]

[DOI]

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Undirected Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Data reduction and exact algorithms for clique cover.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Red-blue covering problems and the consecutive ones property.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Closest 4-leaf power is fixed-parameter tractable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Improved Algorithms and Complexity Results for Power Domination in Graphs.

[BibT_eX]

[DOI]

Daniel Raible

Algorithmica, 2008

Improved Algorithms for Bicluster Editing.

[BibT_eX]

[DOI]

Falk Hüffner

Yong Zhang

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

Fixed-Parameter Algorithms for Kemeny Scores.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Invitation to data reduction and problem kernelization.

[BibT_eX]

[DOI]

SIGACT News, 2007

Parameterized Complexity of Vertex Cover Variants.

[BibT_eX]

[DOI]

Sebastian Wernicke

Theory Comput. Syst., 2007

Feedback arc set in bipartite tournaments is NP-complete.

[BibT_eX]

[DOI]

Falk Hüffner

Hannes Moser

Inf. Process. Lett., 2007

Algorithms for compact letter displays: Comparison and evaluation.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2007

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.

[BibT_eX]

[DOI]

Michael Dom

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

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

[BibT_eX]

[DOI]

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

Linear Problem Kernels for NP-Hard Problems on Planar Graphs.

[BibT_eX]

[DOI]

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

Probe Matrix Problems: Totally Balanced Matrices.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Pattern matching for arc-annotated sequences.

[BibT_eX]

[DOI]

Jens Gramm

ACM Trans. Algorithms, 2006

Parameterized Intractability of Distinguishing Substring Selection.

[BibT_eX]

[DOI]

Jens Gramm

Theory Comput. Syst., 2006

Exact algorithms and applications for Tree-like Weighted Set Cover.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Error Compensation in Leaf Power Problems.

[BibT_eX]

[DOI]

Algorithmica, 2006

Minimum Membership Set Covering and the Consecutive Ones Property.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Complexity and Exact Algorithms for Multicut.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Algorithm design techniques for parameterized graph modification problems.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2006, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Algorithm design techniques for parameterized graph modification problems.

[BibT_eX]

[DOI]

PhD thesis, 2006

2005

Fixed-parameter tractability and data reduction for multicut in trees.

[BibT_eX]

[DOI]

Networks, 2005

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Extending the Tractability Border for Closest Leaf Powers.

[BibT_eX]

[DOI]

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

Parameterized Complexity of Generalized Vertex Cover Problems.

[BibT_eX]

[DOI]

Sebastian Wernicke

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Bounded Degree Closest <i>k</i>-Tree Power Is NP-Complete.

[BibT_eX]

[DOI]

Michael Dom

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Computing the similarity of two sequences with nested arc annotations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.

[BibT_eX]

[DOI]

Algorithmica, 2004

Avoiding Forbidden Submatrices by Row Deletions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

A Structural View on Parameterizing Problems: Distance from Triviality.

[BibT_eX]

[DOI]

Falk Hüffner

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Error Compensation in Leaf Root Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection.

[BibT_eX]

[DOI]

Jens Gramm