| Publication | Date of Publication | Type |
|---|
Consecutive occurrences with distance constraints
| 2024-05-31 | Paper |
Point enclosure problem for homothetic polygons
Lecture Notes in Computer Science | 2023-12-22 | Paper |
On Brooks' Theorem
| 2022-08-03 | Paper |
All nearest smallers made simple
Parallel Processing Letters | 2022-07-08 | Paper |
Zone theorem for arrangements in dimension three
Information Processing Letters | 2021-10-19 | Paper |
scientific article; zbMATH DE number 6876069 (Why is no real title available?)
| 2018-05-29 | Paper |
Algorithms for testing occurrences of length 4 patterns in permutations
Journal of Combinatorial Optimization | 2018-02-21 | Paper |
Maximal independent sets in a generalisation of caterpillar graph
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Maximum cardinality neighbourly sets in quadrilateral free graphs
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
A still simpler way of introducing interior-point method for linear programming
Computer Science Review | 2016-12-14 | Paper |
Parallel vertex colouring of interval graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Faster replacement paths algorithm for undirected, positive integer weighted graphs with small diameter
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Algorithms for Testing Length Four Permutations
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
An efficient parallel algorithm for building the separating tree
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
On finding fundamental cut sets
Information Processing Letters | 2010-09-02 | Paper |
Dominance made simple
Information Processing Letters | 2010-08-16 | Paper |
A note on \(|\overline{N},p^{\alpha}_n,\delta|_k\) summability factors
| 2008-04-03 | Paper |
Parallel algorithms for separable permutations
Discrete Applied Mathematics | 2005-02-22 | Paper |
Local nature of Brooks' colouring for degree 3 graphs
Graphs and Combinatorics | 2004-03-04 | Paper |
Fast parallel edge colouring of graphs.
Journal of Parallel and Distributed Computing | 2003-12-04 | Paper |
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
Information Processing Letters | 2002-07-25 | Paper |
Optimal sublogarithmic time parallel algorithms on rooted forests
Algorithmica | 2000-12-18 | Paper |
Parallel algorithm for finding the most vital edge in weighted graphs
Journal of Parallel and Distributed Computing | 1998-10-01 | Paper |
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
Information Processing Letters | 1997-02-28 | Paper |
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
Information Processing Letters | 1997-02-28 | Paper |
Parallel algorithms for connectivity problems on interval graphs
Information Processing Letters | 1997-02-27 | Paper |
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
Discrete Applied Mathematics | 1996-07-07 | Paper |
Parallel integer sorting and simulation amongst CRCW models
Acta Informatica | 1995-11-16 | Paper |
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
Information Processing Letters | 1994-05-03 | Paper |
Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
Information Processing Letters | 1994-04-04 | Paper |
Improved deterministic parallel integer sorting
Information and Computation | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4090816 (Why is no real title available?)
| 1988-01-01 | Paper |
