| Publication | Date of Publication | Type |
|---|
| Polynomial-time combinatorial algorithm for general max-min fair allocation | 2024-01-25 | Paper |
| Colored constrained spanning tree on directed graphs | 2024-01-16 | Paper |
| Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs | 2024-01-16 | Paper |
| Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries | 2023-07-21 | Paper |
| General max-min fair allocation | 2023-03-30 | Paper |
| Approximating dynamic weighted vertex cover with soft capacities | 2022-02-01 | Paper |
| Historic Moments Discovery in Sequence Data | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009521 | 2021-08-04 | Paper |
| A framework for designing space-efficient dictionaries for parameterized and order-preserving matching | 2021-01-25 | Paper |
| A note on the geodetic number and the Steiner number of AT-free graphs | 2021-01-25 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2020-05-23 | Paper |
| Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions | 2020-03-12 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2018-10-04 | Paper |
| On complexities of minus domination | 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 | 2018-04-10 | Paper |
| Dictionary matching with a bounded gap in pattern or in text | 2018-04-06 | Paper |
| Budget-constrained multi-battle contests: a new perspective and analysis | 2018-03-12 | Paper |
| Scheduling for electricity cost in a smart grid | 2018-02-28 | Paper |
| On Finding the Maximum and Minimum Density Axes-parallel Regions in IRd | 2017-12-05 | Paper |
| Space-time trade-offs for finding shortest unique substrings and maximal unique matches | 2017-10-17 | Paper |
| A Framework for Dynamic Parameterized Dictionary Matching | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369534 | 2017-10-17 | Paper |
| Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem | 2017-08-29 | Paper |
| In-place algorithms for exact and approximate shortest unique substring problems | 2017-08-24 | Paper |
| Convex Independence in Permutation Graphs | 2017-02-01 | Paper |
| P_3-Games on Chordal Bipartite Graphs | 2016-10-22 | Paper |
| Efficient Generation of Top-k Procurements in a Multi-item Auction | 2016-05-03 | Paper |
| Rainbow Domination and Related Problems on Some Classes of Perfect Graphs | 2016-04-01 | Paper |
| In-place algorithms for exact and approximate shortest unique substring problems | 2016-01-11 | Paper |
| Edge-clique covers of the tensor product | 2015-12-08 | Paper |
| $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking | 2015-09-11 | Paper |
| Compressed indexes for dynamic text collections | 2015-09-02 | Paper |
| Dictionary Matching with Uneven Gaps | 2015-08-20 | Paper |
| Compressing dictionary matching index via sparsification technique | 2015-07-10 | Paper |
| On maximum independent set of categorical product and ultimate categorical ratios of graphs | 2015-06-11 | Paper |
| Geometric BWT: compressed text indexing via sparse suffixes and range searching | 2015-05-26 | Paper |
| Edge-Clique Covers of the Tensor Product | 2015-05-20 | Paper |
| APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES | 2015-04-30 | Paper |
| Dynamic dictionary matching and compressed suffix trees | 2014-10-13 | Paper |
| Space-Efficient Frameworks for Top- k String Retrieval | 2014-09-12 | Paper |
| Space-Efficient Framework for Top-k String Retrieval Problems | 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 | 2014-02-18 | Paper |
| Compressed text indexing with wildcards | 2014-02-03 | Paper |
| Compressed property suffix trees | 2013-12-13 | Paper |
| Scheduling for Electricity Cost in Smart Grid | 2013-12-10 | Paper |
| On Complexities of Minus Domination | 2013-12-10 | Paper |
| Indexes for Document Retrieval with Relevance | 2013-09-13 | Paper |
| On Independence Domination | 2013-08-16 | Paper |
| Compressed Persistent Index for Efficient Rank/Select Queries | 2013-08-12 | Paper |
| On position restricted substring searching in succinct space | 2013-06-24 | Paper |
| New Algorithms for Position Heaps | 2013-06-14 | Paper |
| Space-Efficient Construction Algorithm for the Circular Suffix Tree | 2013-06-14 | Paper |
| Independent set in categorical products of cographs and splitgraphs | 2013-05-18 | Paper |
| Faster compressed dictionary matching | 2013-03-04 | Paper |
| Document Listing for Queries with Excluded Pattern | 2012-08-14 | Paper |
| Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval | 2012-08-14 | Paper |
| Efficient Algorithm for Circular Burrows-Wheeler Transform | 2012-08-14 | Paper |
| Succinct Indexes for Circular Patterns | 2011-12-16 | Paper |
| Succinct data structures for searchable partial sums with optimal worst-case performance | 2011-10-10 | Paper |
| Faster query algorithms for the text fingerprinting problem | 2011-07-18 | Paper |
| Cache-oblivious index for approximate string matching | 2011-07-14 | Paper |
| On All-Substrings Alignment Problems | 2011-03-18 | Paper |
| Improved data structures for the orthogonal range successor problem | 2011-01-21 | Paper |
| Efficient index for retrieving top-\(k\) most frequent documents | 2011-01-20 | Paper |
| Compression, Indexing, and Retrieval for Massive String Data | 2010-07-26 | Paper |
| Breaking a Time-and-Space Barrier in Constructing Full-Text Indices | 2010-01-06 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Efficient Data Structures for the Orthogonal Range Successor Problem | 2009-07-23 | Paper |
| Non-shared edges and nearest neighbor interchanges revisited | 2009-07-21 | Paper |
| A Faster Query Algorithm for the Text Fingerprinting Problem | 2008-09-25 | Paper |
| Cache-Oblivious Index for Approximate String Matching | 2008-06-17 | Paper |
| Compressed data structures: Dictionaries and data-aware measures | 2007-12-19 | Paper |
| A Framework for Dynamizing Succinct Data Structures | 2007-11-28 | Paper |
| Compressed Dictionaries: Space Measures, Data Sets, and Experiments | 2007-09-14 | Paper |
| A space and time efficient algorithm for constructing compressed suffix arrays | 2007-07-19 | Paper |
| Approximate string matching using compressed suffix arrays | 2006-03-24 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737696 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472525 | 2004-08-04 | Paper |
