Person:396685

Available identifiers

zbMath Open saxena.sanjeev-kumarMaRDI QIDQ396685

List of research outcomes

Publication	Date of Publication	Type
Consecutive occurrences with distance constraints	2024-05-31	Paper
Point enclosure problem for homothetic polygons	2023-12-22	Paper
On Brooks' Theorem	2022-08-03	Paper
All Nearest Smallers Made Simple	2022-07-08	Paper
Zone theorem for arrangements in dimension three	2021-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q4643838	2018-05-29	Paper
Algorithms for testing occurrences of length 4 patterns in permutations	2018-02-21	Paper
Maximal independent sets in a generalisation of caterpillar graph	2017-03-03	Paper
Maximum cardinality neighbourly sets in quadrilateral free graphs	2017-02-22	Paper
A still simpler way of introducing interior-point method for linear programming	2016-12-14	Paper
PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS	2015-04-29	Paper
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter	2014-08-19	Paper
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs	2014-08-13	Paper
Faster algorithm to find anti-risk path between two nodes of an undirected graph	2014-06-24	Paper
Algorithms for Testing Length Four Permutations	2014-04-03	Paper
An efficient parallel algorithm for building the separating tree	2012-03-07	Paper
On finding fundamental cut sets	2010-09-02	Paper
Dominance made simple	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q5453974	2008-04-03	Paper
Parallel algorithms for separable permutations	2005-02-22	Paper
Local nature of Brooks' colouring for degree 3 graphs	2004-03-04	Paper
Fast parallel edge colouring of graphs.	2003-12-04	Paper
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs	2002-07-25	Paper
Optimal sublogarithmic time parallel algorithms on rooted forests	2000-12-18	Paper
Parallel algorithm for finding the most vital edge in weighted graphs	1998-10-01	Paper
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees	1997-02-28	Paper
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees	1997-02-28	Paper
Parallel algorithms for connectivity problems on interval graphs	1997-02-27	Paper
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM	1996-07-07	Paper
Parallel integer sorting and simulation amongst CRCW models	1995-11-16	Paper
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees	1994-05-03	Paper
Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space	1994-04-04	Paper
Improved deterministic parallel integer sorting	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3817623	1988-01-01	Paper

Research outcomes over time

This page was built for person: Sanjeev Saxena