Janardhan Kulkarni

Available identifiers

zbMath Open kulkarni.janardhanMaRDI QIDQ2210508

List of research outcomes

Publication	Date of Publication	Type
On the hardness of scheduling with non-uniform communication delays	2024-07-19	Paper
https://portal.mardi4nfdi.de/entity/Q6147434	2024-01-15	Paper
On the Facility Location Problem in Online and Dynamic Models.	2023-10-31	Paper
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time	2023-10-31	Paper
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020	2023-10-31	Paper
Flow-time optimization for concurrent open-shop and precedence constrained scheduling models	2021-08-04	Paper
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds	2021-02-02	Paper
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints	2021-02-02	Paper
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs	2021-02-02	Paper
Differentially Private Release of Synthetic Graphs	2021-02-02	Paper
Prior-free multi-unit auctions with ordered bidders	2020-11-06	Paper
Deterministically maintaining a \((2 + \epsilon)\)-approximate minimum vertex cover in \(O(1/\epsilon^2)\) amortized update time	2019-10-15	Paper
A polynomial time constant approximation for minimizing total weighted flow-time	2019-10-15	Paper
Lift and project algorithms for precedence constrained scheduling to minimize completion time	2019-10-15	Paper
Non-clairvoyantly scheduling to minimize convex functions	2019-08-20	Paper
Tight bounds for online vector scheduling	2019-02-08	Paper
Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints	2018-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q4636440	2018-04-19	Paper
Competitive analysis of constrained queueing systems	2017-12-19	Paper
Robust price of anarchy bounds via LP and Fenchel duality	2017-10-05	Paper
Minimum Birkhoff-von Neumann decomposition	2017-08-31	Paper
Coordination mechanisms from (almost) all scheduling policies	2017-05-19	Paper
Minimizing flow-time on unrelated machines	2015-08-21	Paper
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints	2015-06-26	Paper
Coordination mechanisms for selfish routing over time on a tree	2014-07-01	Paper
Online non-clairvoyant scheduling to simultaneously minimize all convex functions	2013-10-04	Paper
Algorithms for cost-aware scheduling	2013-09-13	Paper

Research outcomes over time

This page was built for person: Janardhan Kulkarni