Dzmitry Sledneu

20 papers B 2C 1Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Two algorithms for shortest-paths problems in edge-weighted directed graphs.
Theor. Comput. Sci.
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2022 — conf
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.
CALDAM
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2021 J jnl
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs.
CoRR
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2018 J jnl
3D Rectangulations and Geometric Matrix Multiplication.
Algorithmica
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2018 J jnl
A QPTAS for the base of the number of crossing-free structures on a planar point set.
Theor. Comput. Sci.
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2017 C conf
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.
TAMC
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2016 J jnl
Lawler's minmax cost algorithm: optimality conditions and uncertainty.
J. Sched.
Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu
2016 — —
Studies in Efficient Discrete Algorithms.
Dzmitry Sledneu
2015 — conf
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set.
ICALP (1)
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2015 J jnl
Detecting monomials with k distinct variables.
Inf. Process. Lett.
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2014 B conf
3D Rectangulations and Geometric Matrix Multiplication.
ISAAC
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2014 J jnl
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set.
CoRR
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2014 J jnl
Iterative merging heuristics for correlation clustering.
Int. J. Metaheuristics
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2013 J jnl
Detecting Monomials with k Distinct Variables.
Electron. Colloquium Comput. Complex.
Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2013 J jnl
Optimal cuts and partitions in tree metrics in polynomial time.
Inf. Process. Lett.
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012 B conf
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs.
SOFSEM
Andrzej Lingas, Dzmitry Sledneu
2012 J jnl
Optimal Cuts and Bisections on the Real Line in Polynomial Time
CoRR
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012 J jnl
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time
CoRR
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012 J jnl
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2011 J jnl
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
CoRR
Andrzej Lingas, Dzmitry Sledneu