Sanjeev Saxena

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Maximizing Weighted Dominance in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2024, 2024

Consecutive Occurrences with Distance Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Storage in Computational Geometry.

[BibT_eX]

[DOI]

CoRR, 2023

Point Enclosure Problem for Homothetic Polygons.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Improved Particle Swarm Optimization With Spiral Updating Mechanism for Multimodal Image Registration.

[BibT_eX]

[DOI]

Mausumi Pohit

Int. J. Swarm Intell. Res., 2022

Near Infrared and Visible Image Registration Using Whale Optimization Algorithm.

[BibT_eX]

[DOI]

Mausumi Pohit

Int. J. Appl. Metaheuristic Comput., 2022

Dominance for Containment Problems.

[BibT_eX]

[DOI]

CoRR, 2022

On Brooks' Theorem.

[BibT_eX]

[DOI]

Gopalan Sajith

CoRR, 2022

Simple O(1) Query Algorithm for Level Ancestors.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Zone theorem for arrangements in dimension three.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Sorted Range Reporting.

[BibT_eX]

[DOI]

CoRR, 2021

2020

All Nearest Smallers Made Simple.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

On seat allocation problem with multiple merit lists.

[BibT_eX]

[DOI]

Rahul Kumar Singh

CoRR, 2020

Zone Theorem for Arrangements in three dimensions.

[BibT_eX]

[DOI]

CoRR, 2020

Edge colouring Game on Trees with maximum degree Δ=4.

[BibT_eX]

[DOI]

Akshay Singh

CoRR, 2020

2018

Algorithms for testing occurrences of length 4 patterns in permutations.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

2017

Maximum cardinality neighbourly sets in quadrilateral free graphs.

[BibT_eX]

[DOI]

Neethi K. S.

J. Comb. Optim., 2017

Maximal independent sets in a generalisation of caterpillar graph.

[BibT_eX]

[DOI]

Neethi K. S.

J. Comb. Optim., 2017

A simple introduction to Karmarkar's Algorithm for Linear Programming.

[BibT_eX]

[DOI]

CoRR, 2017

Ellipsoid Method for Linear Programming made simple.

[BibT_eX]

[DOI]

CoRR, 2017

2016

A still simpler way of introducing interior-point method for linear programming.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Comput. Sci. Rev., 2016

Ultra-wideband antenna for a ground penetrating radar.

[BibT_eX]

[DOI]

Niloy Chakrabarti

Sagar Kalra

Malay Ranjan Tripathy

Proceedings of the Thirteenth International Conference on Wireless and Optical Communications Networks, 2016

Design of E-Plane Tee Junction in RSIW for C-Band Applications.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Soft Computing and Pattern Recognition, 2016

Design of H-Plane Tee Junction in RSIW for Ku-Band Applications.

[BibT_eX]

[DOI]

Anamika Banwari

Ridhi Garg

Proceedings of the Eighth International Conference on Soft Computing and Pattern Recognition, 2016

2015

Maximal Independent Sets in Generalised Caterpillar Graphs.

[BibT_eX]

[DOI]

Neethi K. S.

CoRR, 2015

2014

Faster algorithm to find anti-risk path between two nodes of an undirected graph.

[BibT_eX]

[DOI]

Jay Mahadeokar

J. Comb. Optim., 2014

Still Simpler Way of Introducing Interior-Point method for Linear Programming.

[BibT_eX]

[DOI]

CoRR, 2014

Swap Edges of Shortest Path Tree in Parallel.

[BibT_eX]

[DOI]

Anjeneya Swami Kare

Proceedings of the Recent Advances in Information Technology, 2014

Parallel Algorithms for Testing Length Four Permutations.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2013

Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs.

[BibT_eX]

[DOI]

Jay Mahadeokar

J. Discrete Algorithms, 2013

Efficient solutions for finding vitality with respect to shortest paths.

[BibT_eX]

[DOI]

Anjeneya Swami Kare

Proceedings of the Sixth International Conference on Contemporary Computing, 2013

Algorithms for Testing Length Four Permutations.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter.

[BibT_eX]

[DOI]

Jay Mahadeokar

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2010

An efficient parallel algorithm for building the separating tree.

[BibT_eX]

[DOI]

Xiaojun Shen

J. Parallel Distributed Comput., 2010

On finding fundamental cut sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

Dominance made simple.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2005

Parallel algorithms for separable permutations.

[BibT_eX]

[DOI]

V. Yugandhar

Discret. Appl. Math., 2005

2004

Splay Trees.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

2003

Fast parallel edge colouring of graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2003

Local Nature of Brooks' Colouring for Degree 3 Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2003

2000

An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs.

[BibT_eX]

[DOI]

K. V. R. C. N. Kishore

Inf. Process. Lett., 2000

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.

[BibT_eX]

[DOI]

Algorithmica, 2000

1999

Parallel Vertex Colouring of Interval Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

1998

Parallel algorithms for vehicle routing problems.

[BibT_eX]

[DOI]

K. Jeevan Madhu

Proceedings of the 5th International Conference On High Performance Computing, 1998

1997

Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs.

[BibT_eX]

[DOI]

Sudarshan Banerjee

J. Parallel Distributed Comput., 1997

Parallel algorithms for the longest common subsequence problem.

[BibT_eX]

[DOI]

K. Nandan Babu

Proceedings of the Fourth International on High-Performance Computing, 1997

1996

Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Parallel Integer Sorting and Simulation Amongst CRCW Models.

[BibT_eX]

[DOI]

Acta Informatica, 1996

1995

Parallel Algorithms for Connectivity Problems on Interval Graphs.

[BibT_eX]

[DOI]

N. Malahal Rao

Inf. Process. Lett., 1995

Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Parallel algorithms for single row routing in narrow streets.

[BibT_eX]

[DOI]

Saibal Das

Proceedings of the 8th International Conference on VLSI Design (VLSI Design 1995), 1995

1994

On Parallel Prefix Computation.

[BibT_eX]

[DOI]

Pramod Chandra P. Bhatt

V. C. Prasad

Parallel Process. Lett., 1994

Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

1991

Improved Deterministic Parallel Integer Sorting

[BibT_eX]

[DOI]

Inf. Comput., September, 1991

1990

Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions.

[BibT_eX]

[DOI]

P. C. P. Bhatt

V. C. Prasad

IEEE Trans. Computers, 1990

1988

On Parallel Sorting and Addition with Concurrent Writes.

[BibT_eX]

[DOI]