| Publication | Date of Publication | Type |
|---|
Visibility extension via reflection
Theoretical Computer Science | 2025-02-18 | Paper |
Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality
Transactions on Combinatorics | 2025-01-24 | Paper |
Explainable graph clustering via expanders in the massively parallel computation model
Information Sciences | 2024-07-01 | Paper |
Reflective guarding a gallery
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Journal of the ACM | 2022-12-08 | Paper |
Clustering geometrically-modeled points in the aggregated uncertainty model
Fundamenta Informaticae | 2022-03-09 | Paper |
Fair allocation of indivisible goods: beyond additive valuations
Artificial Intelligence | 2022-03-02 | Paper |
Maximin share guarantee for goods with positive externalities
Social Choice and Welfare | 2021-11-12 | Paper |
Fair allocation of indivisible goods: improvement
Mathematics of Operations Research | 2021-09-14 | Paper |
On the Distortion Value of Elections with Abstention
Journal of Artificial Intelligence Research | 2021-03-26 | Paper |
Clearing an orthogonal polygon to find the evaders
Theoretical Computer Science | 2020-11-06 | Paper |
Covering orthogonal polygons with sliding \(k\)-transmitters
Theoretical Computer Science | 2020-04-06 | Paper |
\(1+\varepsilon\) approximation of tree edit distance in quadratic time
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Rent division among groups | 2019-10-11 | Paper |
Visibility extension via mirror-edges to cover invisible segments
Theoretical Computer Science | 2019-09-10 | Paper |
Visibility testing and counting for uncertain segments
Theoretical Computer Science | 2019-06-06 | Paper |
Expand the shares together: envy-free mechanisms with a small number of cuts
Algorithmica | 2019-04-25 | Paper |
Fair Allocation of Indivisible Goods to Asymmetric Agents
Journal of Artificial Intelligence Research | 2019-01-18 | Paper |
| Geometric spanners in the MapReduce model | 2018-10-04 | Paper |
Weak visibility queries of line segments in simple polygons and polygonal domains
International Journal of Computer Mathematics | 2018-05-17 | Paper |
| Approximating edit distance in truly subquadratic time: quantum and MapReduce | 2018-03-15 | Paper |
Approximating edit distance in truly subquadratic time: quantum and MapReduce
(available as arXiv preprint) | 2018-03-15 | Paper |
Randomized approximation algorithms for planar visibility counting problem
Theoretical Computer Science | 2017-12-20 | Paper |
Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems
IEEE Transactions on Circuits and Systems I: Regular Papers | 2017-11-20 | Paper |
Approximate minimum diameter
(available as arXiv preprint) | 2017-10-23 | Paper |
Efficient computation of query point visibility in polygons with holes
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
How to extend visibility polygons by mirrors to cover invisible segments
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Optimal space coverage with white convex polygons
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
Euclidean movement minimization
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
Robots’ Cooperation for Finding a Target in Streets
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Near optimal line segment queries in simple polygons
Journal of Discrete Algorithms | 2015-11-17 | Paper |
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Walking in streets with minimal sensing
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
Weak visibility counting in simple polygons
Journal of Computational and Applied Mathematics | 2015-06-22 | Paper |
Visibility testing and counting
Information Processing Letters | 2015-06-02 | Paper |
Unit covering in color-spanning set model
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
On non-progressive spread of influence through social networks
Theoretical Computer Science | 2014-08-26 | Paper |
Pricing in population games with semi-rational agents
Operations Research Letters | 2014-05-14 | Paper |
Scheduling to minimize gaps and power consumption
Journal of Scheduling | 2014-02-05 | Paper |
\(\alpha\)-visibility
Computational Geometry | 2014-01-22 | Paper |
Walking in Streets with Minimal Sensing
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Equilibrium pricing with positive externalities
Theoretical Computer Science | 2013-04-17 | Paper |
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry | 2013-01-25 | Paper |
Scheduling tasks with exponential duration on unrelated parallel machines
Discrete Applied Mathematics | 2012-10-19 | Paper |
-visibility
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On the non-progressive spread of influence through social networks
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Optimal online pricing with network externalities
Information Processing Letters | 2012-05-04 | Paper |
Efficient observer-dependent simplification in polygonal domains
Algorithmica | 2012-04-26 | Paper |
Permutation betting markets: singleton betting with extra information
Algorithmica | 2011-07-01 | Paper |
White space regions
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Incremental labeling in closed-2PM model
Computers and Electrical Engineering | 2010-11-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Spanning trees with minimum weighted degrees
Information Processing Letters | 2010-03-24 | Paper |
Optimal point removal in closed-2PM labeling
Information Processing Letters | 2010-03-24 | Paper |
| A practical approach for planar visibility maintenance | 2010-01-29 | Paper |
Shortest paths in simple polygons with polygon-meet constraints
Information Processing Letters | 2009-07-21 | Paper |
Space–Query-Time Tradeoff for Computing the Visibility Polygon
Frontiers in Algorithmics | 2009-07-14 | Paper |
An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
Communications in Computer and Information Science | 2009-05-20 | Paper |
Sorting on OTIS-Networks
Communications in Computer and Information Science | 2009-05-20 | Paper |
Kinetic Polar Diagram
Communications in Computer and Information Science | 2009-05-20 | Paper |
SimDiv: A New Solution for Protein Comparison
Lecture Notes in Electrical Engineering | 2009-01-07 | Paper |
| Shortest paths with single point visibility constraint | 2008-11-17 | Paper |
Visiting a Polygon on the Optimal Way to a Query Point
Frontiers in Algorithmics | 2008-06-19 | Paper |
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science | 2008-01-07 | Paper |
Query point visibility computation in polygons with holes
Computational Geometry | 2007-12-03 | Paper |
An approximation algorithm for<i>d</i><sub>1</sub>-optimal motion of a rod robot with fixed rotations
International Journal of Computer Mathematics | 2007-02-15 | Paper |
Label updating to avoid point-shaped obstacles in fixed model
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding
Journal of VLSI signal processing systems for signal, image and video technology | 2006-10-25 | Paper |
| scientific article; zbMATH DE number 2247829 (Why is no real title available?) | 2006-01-16 | Paper |
| scientific article; zbMATH DE number 2247814 (Why is no real title available?) | 2006-01-16 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Pipelined operator tree scheduling in heterogeneous environments.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
Length-constrained path-matchings in graphs
Networks | 2002-09-29 | Paper |
