The following pages link to Jianer Chen (Q1599636):
Displaying 50 items.
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- Overlap matrices and total imbedding distributions (Q1322173) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- On the parameterized complexity of short computation and factorization (Q1387097) (← links)
- Algorithmic graph embeddings (Q1391310) (← links)
- On strong Menger-connectivity of star graphs (Q1406044) (← links)
- An effective randomized QoS routing algorithm on networks with inaccurate parameters (Q1599637) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Corrigendum to: ``Advice classes of parameterized tractability'' (Q1706270) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- Approximation algorithms on multiple two-stage flowshops (Q1791041) (← links)
- On the construction of most reliable networks (Q1827833) (← links)
- A note on practical construction of maximum bandwidth paths. (Q1853065) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Using nondeterminism to design efficient deterministic algorithms (Q1882527) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Parameterized top-\(K\) algorithms (Q1935815) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Scheduling multiple two-stage flowshops with a deadline (Q2140576) (← links)
- Scheduling on multiple two-stage flowshops with a deadline (Q2151364) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- On scheduling inclined jobs on multiple two-stage flowshops (Q2319904) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Extended graph rotation systems as a model for cyclic weaving on orientable surfaces (Q2355747) (← links)
- The cost of becoming anonymous: on the participant payload in crowds (Q2390227) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- On the structure of parameterized problems in NP (Q2508336) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
- QOS routing algorithms for anycast services (Q2751899) (← links)
- Routing in hypercube networks with a constant fraction of faulty nodes (Q2751941) (← links)
- Vertex cover: Further observations and further improvements (Q2775891) (← links)
- (Q2779602) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575) (← links)
- An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem (Q2842775) (← links)
