| Publication | Date of Publication | Type |
|---|
| Breaking a time-and-space barrier in constructing full-text indices | 2026-05-29 | Paper |
The maximum beer flow problem
Theoretical Computer Science | 2026-02-27 | Paper |
| Supereulerian testing on semi-Eulerian graphs | 2025-11-11 | Paper |
Polynomial-time combinatorial algorithm for general max-min fair allocation
Algorithmica | 2024-01-25 | Paper |
Colored constrained spanning tree on directed graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
| General max-min fair allocation | 2023-03-30 | Paper |
Approximating dynamic weighted vertex cover with soft capacities
Algorithmica | 2022-02-01 | Paper |
Historic moments discovery in sequence data
ACM Transactions on Database Systems | 2021-11-25 | Paper |
An \(o(1)\)-approximation algorithm for dynamic weighted vertex cover with soft capacity
(available as arXiv preprint) | 2021-08-04 | Paper |
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Theoretical Computer Science | 2021-01-25 | Paper |
A note on the geodetic number and the Steiner number of AT-free graphs
Theoretical Computer Science | 2021-01-25 | Paper |
A linear-space data structure for range-LCP queries in poly-logarithmic time
Theoretical Computer Science | 2020-05-23 | Paper |
Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
Theoretical Computer Science | 2020-03-12 | Paper |
A linear-space data structure for range-LCP queries in poly-logarithmic time
Lecture Notes in Computer Science | 2018-10-04 | Paper |
On complexities of minus domination
Discrete Optimization | 2018-05-24 | Paper |
| Space-time trade-offs for the shortest unique substring problem | 2018-04-19 | Paper |
On the Grundy number of Cameron graphs
(available as arXiv preprint) | 2018-04-10 | Paper |
Dictionary matching with a bounded gap in pattern or in text
Algorithmica | 2018-04-06 | Paper |
Budget-constrained multi-battle contests: a new perspective and analysis
Theoretical Computer Science | 2018-03-12 | Paper |
Scheduling for electricity cost in a smart grid
Journal of Scheduling | 2018-02-28 | Paper |
On finding the maximum and minimum density axes-parallel regions in R^d
Fundamenta Informaticae | 2017-12-05 | Paper |
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
Theoretical Computer Science | 2017-10-17 | Paper |
| A framework for dynamic parameterized dictionary matching | 2017-10-17 | Paper |
| Space-efficient dictionaries for parameterized and order-preserving pattern matching | 2017-10-17 | Paper |
Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem
Discrete Mathematics | 2017-08-29 | Paper |
In-place algorithms for exact and approximate shortest unique substring problems
Theoretical Computer Science | 2017-08-24 | Paper |
Convex independence in permutation graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
| P₃-Games on Chordal Bipartite Graphs | 2016-10-22 | Paper |
Efficient generation of top-\(k\) procurements in a multi-item auction
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Rainbow domination and related problems on some classes of perfect graphs
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
An in-place framework for exact and approximate shortest unique substring queries
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Edge-clique covers of the tensor product
Theoretical Computer Science | 2015-12-08 | Paper |
Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Dictionary matching with uneven gaps
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Compressing dictionary matching index via sparsification technique
Algorithmica | 2015-07-10 | Paper |
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Theoretical Computer Science | 2015-06-11 | Paper |
Geometric BWT: compressed text indexing via sparse suffixes and range searching
Algorithmica | 2015-05-26 | Paper |
Edge-clique covers of the tensor product
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
| Dynamic dictionary matching and compressed suffix trees | 2014-10-13 | Paper |
Space-efficient frameworks for top-k string retrieval
Journal of the ACM | 2014-09-12 | Paper |
Space-Efficient Framework for Top-k String Retrieval Problems
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Algorithms and Computation | 2014-02-18 | Paper |
Compressed text indexing with wildcards
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Compressed property suffix trees
Information and Computation | 2013-12-13 | Paper |
On complexities of minus domination
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Scheduling for electricity cost in smart grid
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Indexes for document retrieval with relevance
Lecture Notes in Computer Science | 2013-09-13 | Paper |
On independence domination
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Compressed persistent index for efficient rank/select queries
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On position restricted substring searching in succinct space
Journal of Discrete Algorithms | 2013-06-24 | Paper |
New algorithms for position heaps
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Space-efficient construction algorithm for the circular suffix tree
Combinatorial Pattern Matching | 2013-06-14 | Paper |
| Independent set in categorical products of cographs and splitgraphs | 2013-05-18 | Paper |
Faster compressed dictionary matching
Theoretical Computer Science | 2013-03-04 | Paper |
Towards an optimal space-and-query-time index for top-k document retrieval
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Document listing for queries with excluded pattern
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Efficient algorithm for circular Burrows-Wheeler transform
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Succinct indexes for circular patterns
Algorithms and Computation | 2011-12-16 | Paper |
Succinct data structures for searchable partial sums with optimal worst-case performance
Theoretical Computer Science | 2011-10-10 | Paper |
Faster query algorithms for the text fingerprinting problem
Information and Computation | 2011-07-18 | Paper |
Cache-oblivious index for approximate string matching
Theoretical Computer Science | 2011-07-14 | Paper |
On all-substrings alignment problems
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Improved data structures for the orthogonal range successor problem
Computational Geometry | 2011-01-21 | Paper |
Efficient index for retrieving top-\(k\) most frequent documents
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Compression, indexing, and retrieval for massive string data
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Breaking a time-and-space barrier in constructing full-text indices
SIAM Journal on Computing | 2010-01-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Efficient Data Structures for the Orthogonal Range Successor Problem
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Non-shared edges and nearest neighbor interchanges revisited
Information Processing Letters | 2009-07-21 | Paper |
A Faster Query Algorithm for the Text Fingerprinting Problem
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Cache-Oblivious Index for Approximate String Matching
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science | 2007-12-19 | Paper |
A Framework for Dynamizing Succinct Data Structures
Automata, Languages and Programming | 2007-11-28 | Paper |
Compressed Dictionaries: Space Measures, Data Sets, and Experiments
Experimental Algorithms | 2007-09-14 | Paper |
A space and time efficient algorithm for constructing compressed suffix arrays
Algorithmica | 2007-07-19 | Paper |
Approximate string matching using compressed suffix arrays
Theoretical Computer Science | 2006-03-24 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
International Journal of Foundations of Computer Science | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2087050 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080274 (Why is no real title available?) | 2004-08-04 | Paper |
