| 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 | 2024-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147543 | 2024-01-15 | Paper |
| Approximate ridesharing of personal vehicles problem | 2023-03-21 | Paper |
| An efficient oracle for counting shortest paths in planar graphs | 2022-07-01 | Paper |
| An efficient oracle for counting shortest paths in planar graphs | 2022-05-23 | Paper |
| Approximate ridesharing of personal vehicles problem | 2021-06-08 | Paper |
| Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs | 2020-01-07 | Paper |
| Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs | 2019-09-11 | Paper |
| Efficient algorithms for ridesharing of personal vehicles | 2019-08-09 | Paper |
| Computational study on a PTAS for planar dominating set problem | 2019-03-26 | Paper |
| Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs | 2019-03-11 | Paper |
| Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs | 2019-02-20 | Paper |
| Algorithmic analysis for ridesharing of personal vehicles | 2018-12-05 | Paper |
| Optimal branch-decomposition of planar graphs in O ( n 3 ) Time | 2018-11-05 | Paper |
| Efficient algorithms for ridesharing of personal vehicles | 2018-02-26 | Paper |
| Algorithmic Analysis for Ridesharing of Personal Vehicles | 2017-02-01 | Paper |
| New analysis and computational study for the planar connected dominating set problem | 2016-10-20 | Paper |
| An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs | 2016-06-09 | Paper |
| Node-to-set disjoint paths problem in star graphs | 2016-05-26 | Paper |
| Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs | 2016-01-11 | Paper |
| Practical algorithms for branch-decompositions of planar graphs | 2015-12-10 | Paper |
| Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs | 2015-09-09 | Paper |
| Improved bounds on the planar branchwidth with respect to the largest grid minor size | 2013-01-28 | Paper |
| On the complexity and algorithm of grooming regular traffic in WDM optical networks | 2012-07-26 | Paper |
| Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem | 2011-12-16 | Paper |
| Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time | 2011-07-27 | Paper |
| Computational study for planar connected dominating set problem | 2011-01-10 | Paper |
| Improved bounds on the planar branchwidth with respect to the largest grid minor size | 2010-12-09 | Paper |
| Wavelength assignment in multifiber star networks | 2010-11-24 | Paper |
| 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings | 2010-06-16 | Paper |
| Connectivity is not a limit for kernelization: planar connected dominating set | 2010-04-27 | Paper |
| Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time | 2009-12-17 | Paper |
| Computational study on planar dominating set problem | 2009-11-25 | Paper |
| High Performance Computing - HiPC 2003 | 2009-08-11 | Paper |
| Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths | 2009-07-28 | Paper |
| Efficient algorithms for wavelength assignment on trees of rings | 2009-06-30 | Paper |
| Computational Study on Dominating Set Problem of Planar Graphs | 2009-01-27 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Formal description and analysis of a distributed location service for mobile ad hoc networks | 2005-06-10 | Paper |
| A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs | 2003-03-17 | Paper |
| An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes | 2001-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525721 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525695 | 2001-01-24 | Paper |
| Multicolor routing in the undirected hypercube | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263917 | 2000-10-17 | Paper |
| Cluster fault-tolerant routing in star graphs | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937206 | 2000-02-03 | Paper |
| A 2-approximation algorithm for genome rearrangements by reversals and transpositions | 1999-01-12 | Paper |
| Routing a permutation in the hypercube by two sets of edge disjoint paths | 1997-12-17 | Paper |
| Node-to-node cluster fault tolerant routing in star graphs | 1997-02-27 | Paper |
| Convergence properties of optimization algorithms for the SAT problem | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321476 | 1995-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321477 | 1995-06-12 | Paper |
| Learning Monotone Boolean Functions by Uniformly Distributed Examples | 1993-01-16 | Paper |
| Amplification of Bounded Depth Monotone Read-Once Boolean Formulae | 1991-01-01 | Paper |
| A sharper analysis of a prallel algorithm for the all pairs shortest path problem | 1990-01-01 | Paper |
