10 citations · 28 across the 13 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Irreducible triangulations of the once-punctured torus
S. Lawrencenko, T. Sulanke, M. T. Villar +3
A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and…
cs.DS2015★ 3 cited
Search algorithms for efficient logistics chains
Serge Lawrencenko, Irina A. Duborkina
Logistics networks arise whenever there is a transfer of material substance or objects (such as checked baggage on international flights) as well as energy, information, or finance…
math.CO2015★ 2 cited
All face 2-colorable d-angulations are Grünbaum colorable
Serge Lawrencenko, Abdulkarim M. Magomedov
A -angulation of a surface is an embedding of a 3-connected graph on that surface that divides it into -gonal faces. A -angulation is said to be Grünbaum colorable if its…