| Publication | Date of Publication | Type |
|---|
| Shortest path algorithms for nearly acyclic directed graphs | 2024-06-05 | Paper |
Sub-cubic cost algorithms for the all pairs shortest path problem
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
An efficient parallel algorithm for the all pairs shortest path problem
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
| scientific article; zbMATH DE number 7121921 (Why is no real title available?) | 2019-10-24 | Paper |
Algebraic theory on shortest paths for all flows
Theoretical Computer Science | 2019-06-25 | Paper |
Efficient algorithms for the maximum sum problems
Algorithms | 2018-08-20 | Paper |
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
Journal of Discrete Algorithms | 2016-12-09 | Paper |
Algebraic theory on shortest paths for all flows
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Variations on the bottleneck paths problem
Theoretical Computer Science | 2015-04-01 | Paper |
Combining all pairs shortest paths and all pairs bottleneck paths problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Some extensions of the bottleneck paths problem
Algorithms and Computation | 2014-02-18 | Paper |
Sharing information for the all pairs shortest path problem
Theoretical Computer Science | 2014-01-13 | Paper |
| The reverse problem of range query | 2013-08-27 | Paper |
Efficient algorithms for the maximum subarray problem by distance matrix multiplication
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
Information Processing Letters | 2009-12-18 | Paper |
Partial Solution and Entropy
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Algorithm for K Disjoint Maximum Subarrays
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
Algorithms and Computation | 2008-05-27 | Paper |
ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
Solving shortest paths efficiently on nearly acyclic directed graphs
Theoretical Computer Science | 2007-02-26 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science | 2003-07-01 | Paper |
Theory of 2-3 heaps
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1696652 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1576683 (Why is no real title available?) | 2001-05-08 | Paper |
| scientific article; zbMATH DE number 1555939 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1522933 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1444317 (Why is no real title available?) | 2000-05-09 | Paper |
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal
The Computer Journal | 2000-04-10 | Paper |
Shortest path algorithms for nearly acyclic directed graphs
Theoretical Computer Science | 1999-01-12 | Paper |
Subcubic cost algorithms for the all pairs shortest path problem
Algorithmica | 1998-10-19 | Paper |
| scientific article; zbMATH DE number 1043917 (Why is no real title available?) | 1998-02-18 | Paper |
| scientific article; zbMATH DE number 714465 (Why is no real title available?) | 1995-06-12 | Paper |
| scientific article; zbMATH DE number 219247 (Why is no real title available?) | 1993-06-29 | Paper |
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 62663 (Why is no real title available?) | 1992-09-27 | Paper |
Lexical ambiguity in tree adjoining grammars
Information Processing Letters | 1990-01-01 | Paper |
A sharper analysis of a prallel algorithm for the all pairs shortest path problem
Parallel Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4094854 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4045218 (Why is no real title available?) | 1987-01-01 | Paper |
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
SIAM Journal on Computing | 1987-01-01 | Paper |
A decomposition rule for the Hoare logic
Information Processing Letters | 1987-01-01 | Paper |
The Semantics of New While Loop
The Computer Journal | 1986-01-01 | Paper |
A priority queue for the all pairs shortest path problem
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3908469 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3700238 (Why is no real title available?) | 1980-01-01 | Paper |
A definition of measures over language space
Journal of Computer and System Sciences | 1978-01-01 | Paper |
A note on the ambiguity of context-free grammars
Information Processing Letters | 1974-01-01 | Paper |
Fail-safe realization of sequential machines
Information and Control | 1973-01-01 | Paper |
N-Fail-Safe Sequential Machines
IEEE Transactions on Computers | 1972-01-01 | Paper |
N-Fail-Safe Logical Systems
IEEE Transactions on Computers | 1971-01-01 | Paper |
