
The Dynamic kMismatch Problem
The texttopattern Hamming distances problem asks to compute the Hammin...
read it

The Theory of Universal Graphs for Infinite Duration Games
We introduce the notion of universal graphs as a tool for constructing a...
read it

An Almost Optimal Edit Distance Oracle
We consider the problem of preprocessing two strings S and T, of lengths...
read it

Conditional Lower Bounds for Variants of Dynamic LIS
In this note, we consider the complexity of maintaining the longest incr...
read it

FaultTolerant Distance Labeling for Planar Graphs
In faulttolerant distance labeling we wish to assign short labels to th...
read it

Strictly InPlace Algorithms for Permuting and Inverting Permutations
We revisit the problem of permuting an array of length n according to a ...
read it

Fully Dynamic Approximation of LIS in Polylogarithmic Time
We revisit the problem of maintaining the longest increasing subsequence...
read it

Incomplete Directed Perfect Phylogeny in Linear Time
Reconstructing the evolutionary history of a set of species is a central...
read it

Counting 4Patterns in Permutations Is Equivalent to Counting 4Cycles in Graphs
Permutation σ appears in permutation π if there exists a subsequence of ...
read it

Tight Bound for the Number of Distinct Palindromes in a Tree
For an undirected tree with n edges labelled by single letters, we consi...
read it

A Note on a Recent Algorithm for Minimum Cut
Given an undirected edgeweighted graph G=(V,E) with m edges and n verti...
read it

Substring Complexity in Sublinear Space
Shannon's entropy is a definitive lower bound for statistical compressio...
read it

Efficient Labeling for Reachability in Digraphs
We consider labeling nodes of a directed graph for reachability queries....
read it

Dynamic Longest Common Substring in Polylogarithmic Time
The longest common substring problem consists in finding a longest strin...
read it

Efficiently Testing Simon's Congruence
Simon's congruence ∼_k is defined as follows: two words are ∼_kequivale...
read it

A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
The Longest Common Increasing Subsequence (LCIS) is a variant of the cla...
read it

Shorter Labels for Routing in Trees
A routing labeling scheme assigns a binary string, called a label, to ea...
read it

On Two Measures of Distance between FullyLabelled Trees
The last decade brought a significant increase in the amount of data and...
read it

Generalised Pattern Matching Revisited
In the problem of Generalised Pattern Matching (GPM) [STOC'94, Muthukris...
read it

All nontrivial variants of 3LDT are equivalent
The popular 3SUM conjecture states that there is no strongly subquadrat...
read it

Minimum Cut in O(mlog^2 n) Time
We give a randomized algorithm that finds a minimum cut in an undirected...
read it

Minimal Absent Words in Rooted and Unrooted Trees
We extend the theory of minimal absent words to (rooted and unrooted) tr...
read it

Even Faster ElasticDegenerate String Matching via Fast Matrix Multiplication
An elasticdegenerate (ED) string is a sequence of n sets of strings of ...
read it

RLE edit distance in near optimal time
We show that the edit distance between two runlength encoded strings of...
read it

Compressed Range Minimum Queries
Given a string S of n integers in [0,σ), a range minimum query RMQ(i, j)...
read it

Top Tree Compression of Tries
We present a compressed representation of tries based on top tree compre...
read it

The complexity of mean payoff games using universal graphs
We study the computational complexity of solving mean payoff games. This...
read it

Computing Quartet Distance is Equivalent to Counting 4Cycles
The quartet distance is a measure of similarity used to compare two unro...
read it

Almost Optimal Distance Oracles for Planar Graphs
We present new tradeoffs between space and querytime for exact distance...
read it

Fast and Longest Rollercoasters
For k≥ 3, a krollercoaster is a sequence of numbers whose every maximal...
read it

Streaming dictionary matching with mismatches
In the kmismatch problem we are given a pattern of length m and a text ...
read it

NearOptimal Distance Emulator for Planar Graphs
Given a graph G and a set of terminals T, a distance emulator of G is an...
read it

Fast entropybounded string dictionary lookup with mismatches
We revisit the fundamental problem of dictionary lookup with mismatches...
read it

Edit Distance between Unrooted Trees in Cubic Time
Edit distance between trees is a natural generalization of the classical...
read it

A Faster FPTAS for #Knapsack
Given a set W = {w_1,..., w_n} of nonnegative integer weights and an in...
read it

Slowing Down Top Trees for Better WorstCase Bounds
We consider the top tree compression scheme introduced by Bille et al. [...
read it
Paweł Gawrychowski
is this you? claim profile