Dzmitry Sledneu

According to our database, Dzmitry Sledneu authored at least 11 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

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

3D Rectangulations and Geometric Matrix Multiplication.

Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu

Algorithmica, 2018

2017

Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

Lawler's minmax cost algorithm: optimality conditions and uncertainty.

Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu

J. Sched., 2016

2015

Detecting monomials with k distinct variables.

Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Inf. Process. Lett., 2015

2014

Iterative merging heuristics for correlation clustering.

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

Int. J. Metaheuristics, 2014

A QPTAS for the Base of the Number of Triangulations of a Planar Point Set.

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu

CoRR, 2014

2013

Optimal cuts and partitions in tree metrics in polynomial time.

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu

Inf. Process. Lett., 2013

2012

Optimal Cuts and Bisections on the Real Line in Polynomial Time

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu

CoRR, 2012

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs.

Andrzej Lingas, Dzmitry Sledneu

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012