A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. - Andrzej Lingas; Dzmitry Sledneu (SOFSEM, 2012)

Optimal Cuts and Bisections on the Real Line in Polynomial Time - Marek Karpinski; Andrzej Lingas; Dzmitry Sledneu (CoRR, 2012)

Optimal cuts and partitions in tree metrics in polynomial time. - Marek Karpinski; Andrzej Lingas; Dzmitry Sledneu (Inf. Process. Lett., 2013)

A QPTAS for the Base of the Number of Triangulations of a Planar Point Set. - Marek Karpinski; Andrzej Lingas; Dzmitry Sledneu (CoRR, 2014)

Iterative merging heuristics for correlation clustering. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (Int. J. Metaheuristics, 2014)

Detecting monomials with k distinct variables. - Peter Floderus; Andrzej Lingas; Mia Persson; Dzmitry Sledneu (Inf. Process. Lett., 2015)

Lawler's minmax cost algorithm: optimality conditions and uncertainty. - Nadia Brauner; Gerd Finke; Yakov M. Shafransky; Dzmitry Sledneu (J. Sched., 2016)

Studies in Efficient Discrete Algorithms. - Dzmitry Sledneu (2016)

Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (TAMC, 2017)

3D Rectangulations and Geometric Matrix Multiplication. - Peter Floderus; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu (Algorithmica, 2018)

A QPTAS for the base of the number of crossing-free structures on a planar point set. - Marek Karpinski; Andrzej Lingas; Dzmitry Sledneu (Theor. Comput. Sci., 2018)

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. - Andrzej Lingas; Mia Persson; Dzmitry Sledneu (CALDAM, 2022)