Iyad Kanj

Salman Parsa

CoRR, 2024

2023

On the parameterized complexity of clustering problems for incomplete data.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., June, 2023

Dynamic Modeling and Validation of Soft Robotic Snake Locomotion.

[BibT_eX]

[DOI]

CoRR, 2023

Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots.

[BibT_eX]

[DOI]

Umer Huzaifa

IEEE Access, 2023

Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Soft Robotics, 2023

Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits.

[BibT_eX]

[DOI]

Yue Chen

Proceedings of the IEEE International Conference on Soft Robotics, 2023

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The Computational Complexity of Concise Hypersphere Classification.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

The Parameterized Complexity of Coordinated Motion Planning.

[BibT_eX]

[DOI]

Eduard Eiben

Robert Ganian

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Efficient Differencing of System-level Provenance Graphs.

[BibT_eX]

[DOI]

Yuta Nakamura

Tanu Malik

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Study on Soft Robotic Pinniped Locomotion.

[BibT_eX]

[DOI]

Tanmay Varshney

Umer Huzaifa

Thrishantha Nanayakkara

Yue Chen

Hunter B. Gilbert

Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2023

2022

On Covering Segments with Unit Intervals.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

RRT*-Based Path Planning for Continuum Arms.

[BibT_eX]

[DOI]

Brandon H. Meng

IEEE Robotics Autom. Lett., 2022

Near-optimal algorithms for point-line fitting problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Near-Optimal Algorithms for Point-Line Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Provenance-based Workflow Diagnostics Using Program Specification.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on High Performance Computing, 2022

Finding a Cluster in Incomplete Data.

[BibT_eX]

[DOI]

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

2021

Optimal Streaming Algorithms for Graph Matching.

[BibT_eX]

[DOI]

CoRR, 2021

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Smooth Path Planning for Continuum Arms.

[BibT_eX]

[DOI]

Brandon H. Meng

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Anticipatory Path Planning for Continuum Arms in Dynamic Environments.

[BibT_eX]

[DOI]

Brandon H. Meng

Jiahao Deng

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

The Parameterized Complexity of Clustering Incomplete Data.

[BibT_eX]

[DOI]

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

2020

On Existential MSO and Its Relation to ETH.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2020

A Colored Path Problem and Its Applications.

[BibT_eX]

[DOI]

Eduard Eiben

ACM Trans. Algorithms, 2020

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

SIAM J. Discret. Math., 2020

The Complexity of Tree Partitioning.

[BibT_eX]

[DOI]

Algorithmica, 2020

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.

[BibT_eX]

[DOI]

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

On the Problem of Covering a 3-D Terrain.

[BibT_eX]

[DOI]

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

2019

On Clustering Incomplete Data.

[BibT_eX]

[DOI]

CoRR, 2019

Near-optimal Smooth Path Planning for Multisection Continuum Arms.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Soft Robotics, 2019

The Parameterized Complexity of Cascading Portfolio Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2018

Parameterized Algorithms for the Matrix Completion Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

How to Navigate Through Obstacles?.

[BibT_eX]

[DOI]

Eduard Eiben

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

Improved Results for Minimum Constraint Removal.

[BibT_eX]

[DOI]

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

2017

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Degree four plane spanners: Simpler and better.

[BibT_eX]

[DOI]

Duru Türkoglu

J. Comput. Geom., 2017

Finding Points in General Position.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Inf. Comput., 2017

Computing the Flip Distance Between Triangulations.

[BibT_eX]

[DOI]

Eric Sedgwick

Discret. Comput. Geom., 2017

Guest Editorial: Special Issue on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Thore Husfeldt

Algorithmica, 2017

2016

On the Ordered List Subgraph Embedding Problems.

[BibT_eX]

[DOI]

Algorithmica, 2016

Twins in Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

René van Bevern

Rolf Niedermeier

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Parameterized and subexponential-time complexity of satisfiability problems and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Improved parameterized and exact algorithms for cut problems on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Subexponential-Time Complexity of CSP.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2015

There are Plane Spanners of Degree 4 and Moderate Stretch Factor.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.

[BibT_eX]

[DOI]

René van Bevern

Rolf Niedermeier

CoRR, 2015

Flip Distance Is in FPT Time O(n+ k * c^k).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

On certain geometric properties of the Yao-Yao graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Flip Distance is in FPT time $O(n+ k \cdot c^k)$.

[BibT_eX]

[DOI]

CoRR, 2014

Small Unsatisfiable Subsets in Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Subexponential Time Complexity of CSP with Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

There are Plane Spanners of Maximum Degree 4.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Algorithms for Cut Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

On the independence number of graphs with maximum degree 3.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Parameterized top-K algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

When Is Weighted Satisfiability FPT?

[BibT_eX]

[DOI]

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

Local Backbones.

[BibT_eX]

[DOI]

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

The Radiation Hybrid Map Construction Problem Is FPT.

[BibT_eX]

[DOI]

Binhai Zhu

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Geometric spanners: Recent results and open directions.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Communications and Information Technology, 2013

On the Subexponential Time Complexity of CSP.

[BibT_eX]

[DOI]

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

2012

Local Construction of Spanners in the 3D Space.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2012

Improved local algorithms for spanner construction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Multicut in trees viewed through the eyes of vertex cover.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Parameterized Complexity and Subexponential-Time Computability.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Separability and topology control of quasi unit disk graphs.

[BibT_eX]

[DOI]

Wirel. Networks, 2011

Local algorithms for edge colorings in UDGs.

[BibT_eX]

[DOI]

Andreas Wiese

Theor. Comput. Sci., 2011

On the induced matching problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

What makes normalized weighted satisfiability tractable

[BibT_eX]

[DOI]

CoRR, 2011

On the stretch factor of Delaunay triangulations of points in convex position.

[BibT_eX]

[DOI]

Shiliang Cui

Comput. Geom., 2011

Editing Graphs into Disjoint Unions of Dense Clusters.

[BibT_eX]

[DOI]

Jiong Guo

Johannes Uhlmann

Algorithmica, 2011

Safe Approximation and Its Relation to Kernelization.

[BibT_eX]

[DOI]

Jiong Guo

Stefan Kratsch

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

2010

Improved upper bounds for vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On Spanners and Lightweight Spanners of Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

The parameterized complexity of some minimum label problems.

[BibT_eX]

[DOI]

Michael R. Fellows

Jiong Guo

J. Comput. Syst. Sci., 2010

2009

Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2009

On parameterized exponential time complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the pseudo-achromatic number problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On Spanners of Geometric Graphs.

[BibT_eX]

[DOI]

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

What Makes Equitable Connected Partition Easy.

[BibT_eX]

[DOI]

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

Local Construction of Spanners in the 3-D Space.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2009

Convex Recoloring Revisited: Complexity and Exact Algorithms.

[BibT_eX]

[DOI]

Dieter Kratsch

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

On the Dilation of Delaunay Triangulations of Points in Convex Position.

[BibT_eX]

[DOI]

Shiliang Cui

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Seeing the trees and their branches in the network is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Luay Nakhleh

Algorithmica, 2008

Foreword from the Guest Editors.

[BibT_eX]

[DOI]

Algorithmica, 2008

Computing Lightweight Spanners Locally.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On Geometric Spanners of Euclidean and Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

2007

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Genus characterizes the complexity of certain graph problems: Some tight results.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Polynomial time approximation schemes and parameterized complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Seeing the Trees and Their Branches in the Forest is Hard.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.

[BibT_eX]

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006

Strong computational lower bounds via parameterized complexity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

On the computational hardness based on linear FPT-reductions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Improved Parameterized Upper Bounds for Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On the Effective Enumerability of NP Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Luay Nakhleh

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

On approximating minimum vertex cover for graphs with perfect matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Hypercube Network Fault Tolerance: A Probabilistic Approach.

[BibT_eX]

[DOI]

Guojun Wang

J. Interconnect. Networks, 2005

Tight lower bounds for certain parameterized NP-hard problems.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.

[BibT_eX]

[DOI]

Algorithmica, 2005

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.

[BibT_eX]

[DOI]

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

2004

Improved exact algorithms for MAX-SAT.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Using Nondeterminism to Design Efficient Deterministic Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2004

Linear FPT reductions and computational lower bounds.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Parameterized Algorithms for Feedback Vertex Set.

[BibT_eX]

[DOI]

Michael J. Pelsmajer

Marcus Schaefer

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

2003

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

The inapproximability of non-NP-hard optimization problems.

[BibT_eX]

[DOI]

Liming Cai

David W. Juedes

Theor. Comput. Sci., 2002

Improved Parameterized Algorithms for Planar Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Improved Exact Algorithms for MAX-SAT.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers.

[BibT_eX]

[DOI]

Eunseuk Oh

Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002

2001

Vertex Cover: Further Observations and Further Improvements.

[BibT_eX]

[DOI]

Weijia Jia

J. Algorithms, 2001

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.

[BibT_eX]

[DOI]