Sergey Pupyrev

Karthik Abinav Sankararaman

Proceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction, 2024

2023

Matching algorithms for blood donation.

[BibT_eX]

[DOI]

Zack Chauvin

Neil Dexter

John P. Dickerson

Nat. Mac. Intell., October, 2023

Lazy Queue Layouts of Posets.

[BibT_eX]

[DOI]

Algorithmica, May, 2023

Linear Layouts of Bipartite Planar Graphs.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Optimizing Function Layout for Mobile Applications.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGPLAN/SIGBED International Conference on Languages, 2023

Fair Allocation Over Time, with Applications to Content Moderation.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

On Families of Planar DAGs with Constant Stack Number.

[BibT_eX]

[DOI]

Martin Nöllenburg

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

The mixed page number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Profile inference revisited.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Minimum Coverage Instrumentation.

[BibT_eX]

[DOI]

CoRR, 2022

Robust and fair work allocation.

[BibT_eX]

[DOI]

CoRR, 2022

Approximating the Minimum Logarithmic Arrangement Problem.

[BibT_eX]

[DOI]

Julián Mestre

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Queue Layouts of Two-Dimensional Posets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

On dispersable book embeddings.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Theor. Comput. Sci., 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.

[BibT_eX]

[DOI]

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

On the Extended TSP Problem.

[BibT_eX]

[DOI]

Julián Mestre

Seeun William Umboh

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Improved Basic Block Reordering.

[BibT_eX]

[DOI]

Andy Newell

Chrysanthi N. Raftopoulou

IEEE Trans. Computers, 2020

Four Pages Are Indeed Necessary for Planar Graphs.

[BibT_eX]

[DOI]

Torsten Ueckerdt

J. Comput. Geom., 2020

Improved Bounds for Track Numbers of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Book Embeddings of Graph Products.

[BibT_eX]

[DOI]

CoRR, 2020

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

Algorithmica, 2020

The Turing Test for Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent.

[BibT_eX]

[DOI]

Dmitrii Avdiukhin

Grigory Yaroslavtsev

Proc. VLDB Endow., 2019

Bandana: Using Non-Volatile Memory for Storing Deep Learning Models.

[BibT_eX]

[DOI]

Proceedings of Machine Learning and Systems 2019, 2019

2018

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

CoRR, 2018

On Dispersable Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Threshold-coloring and unit-cube contact representation of planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Improved Approximation Algorithms for Box Contact Representations.

[BibT_eX]

[DOI]

Algorithmica, 2017

Mixed Linear Layouts of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Representing Permutations with Few Moves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Edge routing with ordered bundles.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Compressing Graphs and Indexes with Recursive Graph Bisection.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

The Bundled Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Ordering Metro Lines by Block Crossings.

[BibT_eX]

[DOI]

Alexander Wolff

J. Graph Algorithms Appl., 2015

MapSets: Visualizing Embedded and Clustered Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs.

[BibT_eX]

[DOI]

Torsten Ueckerdt

CoRR, 2015

Contact Representations of Sparse Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Weak Unit Disk and Interval Representation of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Contact Representations of Graphs in 3D.

[BibT_eX]

[DOI]

Torsten Ueckerdt

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Contact Graphs of Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Colored Non-crossing Euclidean Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

On Embeddability of Buses in Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Weak Unit Disk and Interval Representation of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Computing Consensus Curves.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Experimental Comparison of Semantic Word Clouds.

[BibT_eX]

[DOI]

Lukas Barth

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Visualizing Graphs as Maps with Contiguous Regions.

[BibT_eX]

[DOI]

Paolo Simonetto

Proceedings of the 16th Eurographics Conference on Visualization, 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Perfect smooth orthogonal drawings.

[BibT_eX]

[DOI]

Michael A. Bekos

Martin Gronemann

Chrysanthi N. Raftopoulou

Proceedings of the 5th International Conference on Information, 2014

3D proportional contact representations of graphs.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information, 2014

Are Crossings Important for Drawing Large Graphs?

[BibT_eX]

[DOI]

Bahador Saket

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Balanced Circle Packings for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Happy Edges: Threshold-Coloring of Regular Lattices.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

On Semantic Word Cloud Representation

[BibT_eX]

[DOI]

CoRR, 2013

Threshold Coloring and Unit-Cube Contact Representation of Graphs

[BibT_eX]

[DOI]

CoRR, 2013

Threshold-Coloring of Archimedean and Laves Lattices.

[BibT_eX]

[DOI]

CoRR, 2013

Threshold-Coloring and Unit-Cube Contact Representation of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Ordering Metro Lines by Block Crossings.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Drawing Permutations with Few Corners.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2010

Analyzing conversations with dynamic graph visualization.

[BibT_eX]

[DOI]

Alexey Tikhonov

Proceedings of the 10th International Conference on Intelligent Systems Design and Applications, 2010

Improving Layered Graph Layouts with Edge Bundling.

[BibT_eX]

[DOI]