| Publication | Date of Publication | Type |
|---|
| Algorithms for the ridesharing with profit constraint problem | 2024-09-16 | Paper |
Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles
Computers & Operations Research | 2024-06-06 | Paper |
scientific article; zbMATH DE number 7788612 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Approximate ridesharing of personal vehicles problem
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
An efficient oracle for counting shortest paths in planar graphs
Algorithmic Aspects in Information and Management | 2022-07-01 | Paper |
An efficient oracle for counting shortest paths in planar graphs
Theoretical Computer Science | 2022-05-23 | Paper |
Approximate ridesharing of personal vehicles problem
Theoretical Computer Science | 2021-06-08 | Paper |
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
Information Sciences | 2020-01-07 | Paper |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Efficient algorithms for ridesharing of personal vehicles
Theoretical Computer Science | 2019-08-09 | Paper |
Computational study on a PTAS for planar dominating set problem
Algorithms | 2019-03-26 | Paper |
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
Discrete Applied Mathematics | 2019-03-11 | Paper |
Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
Theoretical Computer Science | 2019-02-20 | Paper |
Algorithmic analysis for ridesharing of personal vehicles
Theoretical Computer Science | 2018-12-05 | Paper |
Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Efficient algorithms for ridesharing of personal vehicles
Combinatorial Optimization and Applications | 2018-02-26 | Paper |
Algorithmic Analysis for Ridesharing of Personal Vehicles
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
New analysis and computational study for the planar connected dominating set problem
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
Information Processing Letters | 2016-06-09 | Paper |
Node-to-set disjoint paths problem in star graphs
Information Processing Letters | 2016-05-26 | Paper |
Constant query time \((1+\epsilon)\)-approximate distance oracle for planar graphs
Algorithms and Computation | 2016-01-11 | Paper |
Practical algorithms for branch-decompositions of planar graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Improved bounds on the planar branchwidth with respect to the largest grid minor size
Algorithmica | 2013-01-28 | Paper |
On the complexity and algorithm of grooming regular traffic in WDM optical networks
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Computational study on bidimensionality theory based algorithm for longest path problem
Algorithms and Computation | 2011-12-16 | Paper |
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
Theoretical Computer Science | 2011-07-27 | Paper |
Computational study for planar connected dominating set problem
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Improved bounds on the planar branchwidth with respect to the largest grid minor size
Algorithms and Computation | 2010-12-09 | Paper |
Wavelength assignment in multifiber star networks
Networks | 2010-11-24 | Paper |
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters | 2010-06-16 | Paper |
Connectivity is not a limit for kernelization: planar connected dominating set
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
Algorithms and Computation | 2009-12-17 | Paper |
Computational study on planar dominating set problem
Theoretical Computer Science | 2009-11-25 | Paper |
High Performance Computing - HiPC 2003
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
Networks | 2009-07-28 | Paper |
Efficient algorithms for wavelength assignment on trees of rings
Discrete Applied Mathematics | 2009-06-30 | Paper |
Computational Study on Dominating Set Problem of Planar Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Formal description and analysis of a distributed location service for mobile ad hoc networks
Theoretical Computer Science | 2005-06-10 | Paper |
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Acta Mathematicae Applicatae Sinica. English Series | 2003-03-17 | Paper |
An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
Journal of Parallel and Distributed Computing | 2001-02-08 | Paper |
| scientific article; zbMATH DE number 1555951 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555929 (Why is no real title available?) | 2001-01-24 | Paper |
Multicolor routing in the undirected hypercube
Discrete Applied Mathematics | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1342319 (Why is no real title available?) | 2000-10-17 | Paper |
| Cluster fault-tolerant routing in star graphs | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1398085 (Why is no real title available?) | 2000-02-03 | Paper |
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science | 1999-01-12 | Paper |
Routing a permutation in the hypercube by two sets of edge disjoint paths
Journal of Parallel and Distributed Computing | 1997-12-17 | Paper |
Node-to-node cluster fault tolerant routing in star graphs
Information Processing Letters | 1997-02-27 | Paper |
Convergence properties of optimization algorithms for the SAT problem
IEEE Transactions on Computers | 1996-01-01 | Paper |
| scientific article; zbMATH DE number 714464 (Why is no real title available?) | 1995-06-12 | Paper |
| scientific article; zbMATH DE number 714465 (Why is no real title available?) | 1995-06-12 | Paper |
Learning Monotone Boolean Functions by Uniformly Distributed Examples
SIAM Journal on Computing | 1993-01-16 | Paper |
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae
SIAM Journal on Computing | 1991-01-01 | Paper |
A sharper analysis of a prallel algorithm for the all pairs shortest path problem
Parallel Computing | 1990-01-01 | Paper |
