Qian-Ping Gu

CoRR, 2023

Algorithms for the Ridesharing with Profit Constraint Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

An efficient oracle for counting shortest paths in planar graphs.

[BibT_eX]

[DOI]

Ye Gong

Theor. Comput. Sci., 2022

2021

Approximate ridesharing of personal vehicles problem.

[BibT_eX]

[DOI]

Guochuan Zhang

Theor. Comput. Sci., 2021

Multimodal Transportation with Ridesharing of Personal Vehicles.

[BibT_eX]

[DOI]

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

2020

Atomos: Constant-Size Path Validation Proof.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2020

2019

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Efficient algorithms for ridesharing of personal vehicles.

[BibT_eX]

[DOI]

Guochuan Zhang

Theor. Comput. Sci., 2019

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Algorithmic analysis for ridesharing of personal vehicles.

[BibT_eX]

[DOI]

Guochuan Zhang

Theor. Comput. Sci., 2018

2017

Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

New analysis and computational study for the planar connected dominating set problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2016

A Practical Algorithm for Embedding Graphs on Torus.

[BibT_eX]

[DOI]

Jiahua Yu

Int. J. Netw. Comput., 2016

Practical algorithms for branch-decompositions of planar graphs.

[BibT_eX]

[DOI]

Mingzhe Zhu

Discret. Appl. Math., 2016

2015

Preface.

[BibT_eX]

[DOI]

Pavol Hell

Boting Yang

Theor. Comput. Sci., 2015

Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2013

Computational Study on a PTAS for Planar Dominating Set Problem.

[BibT_eX]

[DOI]

Algorithms, 2013

2012

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.

[BibT_eX]

[DOI]

Algorithmica, 2012

Carving-decomposition based algorithms for the maximum path coloring problem.

[BibT_eX]

[DOI]

Mehwish Bashir

Proceedings of IEEE International Conference on Communications, 2012

2011

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem.

[BibT_eX]

[DOI]

Chunhao Wang

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Wavelength assignment in multifiber star networks.

[BibT_eX]

[DOI]

Networks, 2010

Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set.

[BibT_eX]

[DOI]

Qianping Gu

Navid Imani

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Computational Study for Planar Connected Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Computational study on planar dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths.

[BibT_eX]

[DOI]

Networks, 2009

1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Efficient algorithms for wavelength assignment on trees of rings.

[BibT_eX]

[DOI]

Xiao Zhou

Discret. Appl. Math., 2009

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Optimal branch-decomposition of planar graphs in O(n3) Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

On the complexity and algorithm of grooming regular traffic in WDM optical networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

Computing Branch Decomposition of Large Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Computational Study on Dominating Set Problem of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

Wavelength Assignment in Multifiber WDM Star and Spider Networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2007

Maximizing Throughput for Traffic Grooming with Limited Grooming Resources.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2007

2006

Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2006

Efficient Algorithms for Traffic Grooming in SONET/WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

2005

Formal description and analysis of a distributed location service for mobile ad hoc networks.

[BibT_eX]

[DOI]

Uwe Glässer

Theor. Comput. Sci., 2005

Tight Bounds for Wavelength Assignment on Trees of Rings.

[BibT_eX]

[DOI]

Xiao Zhou

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004

Wavelength Assignment on Bounded Degree Trees of Rings.

[BibT_eX]

[DOI]

Xiao Zhou

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2003

Multihop All-to-All Broadcast on WDM Optical Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2003

Efficient Algorithm for Embedding Hypergraphs in a Cycle.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2002

Multicasts on WDM All-Optical Butterfly Networks.

[BibT_eX]

[DOI]

Xinchen Liu

J. Inf. Sci. Eng., 2002

On-line Permutation Routing on WDM All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

2001

Multi-hop All-to-All Broadcast on WDM Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the 30th International Workshops on Parallel Processing (ICPP 2001 Workshops), 2001

Multicasts on WDM All-Optical Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Xinchen Liu

Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

2000

Cluster fault-tolerant routing in star graphs.

[BibT_eX]

[DOI]

Networks, 2000

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

Multicolor routing in the undirected hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Conference on Parallel Processing, 2000

1999

Unicast in Hypercubes with Large Number of Faulty Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1999

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.

[BibT_eX]

[DOI]

Ivan Hal Sudborough

Theor. Comput. Sci., 1999

On optimizing the satisfiability (SAT) problem.

[BibT_eX]

[DOI]

Ding-Zhu Du

J. Comput. Sci. Technol., 1999

1998

Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Parallel Comput., 1998

An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

Routing in Hypercubes with Large Number of Faulty Nodes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel and Distributed Systems, 1998

1997

k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Node-To-Set Disjoint Paths Problem in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie.

[BibT_eX]

Zixue Cheng

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Node-to-Node Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Multi-Color Routing in the Undirected Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Convergence Properties of Optimization Algorithms for the SAT Problem.

[BibT_eX]

[DOI]

Ding-Zhu Du

IEEE Trans. Computers, 1996

Fault Tolerant Routing in Hypercubes and Star Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1996

An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters.

[BibT_eX]

[DOI]

Comput. J., 1996

Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 1996

An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), 1996

1995

Two Packet Routing Algorithms on a Mesh-Connected Computer.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1995

Node-to-Node Cluster Fault Tolerant Routing in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 1995

An efficient algorithm for k-pairwise node disjoint path problem in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters.

[BibT_eX]

Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

1994

Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

Advanced fault tolerant routing in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Average Time Complexity of the SAT 1.2 Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Algorithms for Node Disjoint Paths in Incomplete Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

1992

Learning Monotone Boolean Functions by Uniformly Distributed Examples.

[BibT_eX]

[DOI]

Akira Maruoka

SIAM J. Comput., 1992

1991

Amplification of Bounded Depth Monotone Read-Once Boolean Formulae.

[BibT_eX]

[DOI]

Akira Maruoka

SIAM J. Comput., 1991

Learning boolean functions.

[BibT_eX]

[DOI]

Akira Maruoka

Syst. Comput. Jpn., 1991

1990

A sharper analysis of a parallel algorithm for the all pairs shortest path problem.

[BibT_eX]

[DOI]