Sergey Pupyrev

From MaRDI portal
Person:283870

Available identifiers

zbMath Open pupyrev.sergeyMaRDI QIDQ283870

List of research outcomes





PublicationDate of PublicationType
Approximating the minimum logarithmic arrangement problem2024-09-11Paper
On families of planar DAGs with constant stack number2024-06-21Paper
https://portal.mardi4nfdi.de/entity/Q61475492024-01-15Paper
Queue layouts of two-dimensional posets2023-08-16Paper
The Turing Test for Graph Drawing Algorithms2021-12-01Paper
On Families of Planar DAGs with Constant Stack Number2021-07-28Paper
The Mixed Page Number of Graphs2021-07-11Paper
Improved Basic Block Reordering2020-12-14Paper
Four pages are indeed necessary for planar graphs2020-09-09Paper
Improved bounds for track numbers of planar graphs2020-09-04Paper
Book Embeddings of Graph Products2020-07-29Paper
Mixed linear layouts of planar graphs2019-02-20Paper
Improved approximation algorithms for box contact representations2017-04-12Paper
The Bundled Crossing Number2017-02-21Paper
On embeddability of buses in point sets2017-02-10Paper
Threshold-coloring and unit-cube contact representation of planar graphs2016-11-24Paper
Weak unit disk and interval representation of graphs2016-10-21Paper
Representing permutations with few moves2016-10-20Paper
Edge routing with ordered bundles2016-05-17Paper
Colored Non-crossing Euclidean Steiner Forest2016-01-11Paper
MapSets: visualizing embedded and clustered graphs2016-01-07Paper
Contact representations of graphs in 3D2015-10-30Paper
Contact Graphs of Circular Arcs2015-10-30Paper
Ordering metro lines by block crossings2015-03-04Paper
Are crossings important for drawing large graphs?2015-01-07Paper
MapSets: visualizing embedded and clustered graphs2015-01-07Paper
Balanced circle packings for planar graphs2015-01-07Paper
Improved approximation algorithms for box contact representations2014-10-08Paper
Semantic word cloud representations: hardness and approximation algorithms2014-03-31Paper
Metro-line crossing minimization: hardness, approximations, and tractable cases2013-12-20Paper
Drawing permutations with few corners2013-12-20Paper
Threshold-coloring and unit-cube contact representation of graphs2013-12-06Paper
Ordering Metro Lines by Block Crossings2013-09-20Paper
Edge routing with ordered bundles2012-03-09Paper
Improving layered graph layouts with edge bundling2011-02-11Paper

Research outcomes over time

This page was built for person: Sergey Pupyrev