Ge Xia

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6104071	2023-06-05	Paper
The complexity of tree partitioning	2020-09-03	Paper
There are Plane Spanners of Maximum Degree 4	2018-04-23	Paper
New and Improved Spanning Ratios for Yao Graphs	2018-04-23	Paper
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability	2017-11-16	Paper
Computing the flip distance between triangulations	2017-10-10	Paper
The complexity of tree partitioning	2017-09-22	Paper
New and improved spanning ratios for Yao graphs	2017-03-30	Paper
Flip Distance Is in FPT Time O(n+ k * c^k)	2017-01-24	Paper
Edge-disjoint packing of stars and cycles	2016-07-05	Paper
Edge-Disjoint Packing of Stars and Cycles	2016-02-05	Paper
Improved parameterized and exact algorithms for cut problems on trees	2015-12-11	Paper
Algorithms for Cut Problems on Trees	2015-09-11	Paper
There are plane spanners of degree 4 and moderate stretch factor	2015-06-18	Paper
Improved upper bound on the stretch factor of delaunay triangulations	2014-03-24	Paper
On certain geometric properties of the Yao-Yao graphs	2014-02-25	Paper
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998	2013-11-14	Paper
When Is Weighted Satisfiability FPT?	2013-08-12	Paper
On the Induced Matching Problem	2013-03-19	Paper
Parameterized top-\(K\) algorithms	2013-02-19	Paper
On Certain Geometric Properties of the Yao-Yao Graphs	2012-11-02	Paper
Improved local algorithms for spanner construction	2012-10-11	Paper
Kernelization for cycle transversal problems	2012-05-30	Paper
On the induced matching problem	2012-01-11	Paper
On the small cycle transversal of planar graphs	2011-07-14	Paper
On the stretch factor of Delaunay triangulations of points in convex position	2011-01-31	Paper
On Spanners and Lightweight Spanners of Geometric Graphs	2011-01-17	Paper
On the Small Cycle Transversal of Planar Graphs	2010-11-16	Paper
Improved upper bounds for vertex cover	2010-10-11	Paper
Linear FPT reductions and computational lower bounds	2010-08-15	Paper
Kernelization for Cycle Transversal Problems	2010-07-20	Paper
Algorithms and Computation	2009-08-07	Paper
On parameterized exponential time complexity	2009-07-10	Paper
On Parameterized Exponential Time Complexity	2009-06-03	Paper
On the pseudo-achromatic number problem	2009-03-17	Paper
On the Pseudo-achromatic Number Problem	2009-01-20	Paper
Computing Lightweight Spanners Locally	2008-11-20	Paper
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size	2008-08-14	Paper
Seeing the trees and their branches in the network is hard	2008-07-31	Paper
The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms	2008-07-01	Paper
On the Effective Enumerability of NP Problems	2008-06-03	Paper
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms	2007-09-10	Paper
Improved Parameterized Upper Bounds for Vertex Cover	2007-09-05	Paper
Genus characterizes the complexity of certain graph problems: Some tight results	2007-08-23	Paper
Polynomial time approximation schemes and parameterized complexity	2007-02-19	Paper
Strong computational lower bounds via parameterized complexity	2006-12-07	Paper
On the computational hardness based on linear fpt-reductions	2006-08-14	Paper
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems	2006-03-21	Paper
Computing and Combinatorics	2006-01-11	Paper
STACS 2005	2005-12-02	Paper
Tight lower bounds for certain parameterized NP-hard problems	2005-10-10	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4449224	2004-02-08	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ge Xia