research
∙
05/25/2023
Linear Layouts of Bipartite Planar Graphs
A linear layout of a graph G consists of a linear order ≺ of the vertice...
share
research
∙
11/17/2022
Optimizing Function Layout for Mobile Applications
Function layout, also referred to as function reordering or function pla...
research
∙
08/29/2022
Minimum Coverage Instrumentation
Modern compilers leverage block coverage profile data to carry out downs...
research
∙
08/26/2022
Queue Layouts of Two-Dimensional Posets
The queue number of a poset is the queue number of its cover graph when ...
research
∙
02/10/2022
Robust and fair work allocation
In today's digital world, interaction with online platforms is ubiquitou...
research
∙
08/10/2021
Matching Algorithms for Blood Donation
Global demand for donated blood far exceeds supply, and unmet need is gr...
research
∙
07/28/2021
On Families of Planar DAGs with Constant Stack Number
A k-stack layout (or k-page book embedding) of a graph consists of a tot...
research
∙
07/16/2021
On the Extended TSP Problem
We initiate the theoretical study of Ext-TSP, a problem that originates ...
research
∙
07/11/2021
The Mixed Page Number of Graphs
A linear layout of a graph typically consists of a total vertex order, a...
research
∙
08/24/2020
Lazy Queue Layouts of Posets
We investigate the queue number of posets in terms of their width, that ...
research
∙
07/29/2020
Book Embeddings of Graph Products
A k-stack layout (also called a k-page book embedding) of a graph consis...
research
∙
04/16/2020
Four Pages Are Indeed Necessary for Planar Graphs
An embedding of a graph in a book consists of a linear order of its vert...
research
∙
10/30/2019
Improved Bounds for Track Numbers of Planar Graphs
A track layout of a graph consists of a vertex coloring and of a total o...
research
∙
02/10/2019
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent
Motivated by performance optimization of large-scale graph processing sy...
research
∙
11/14/2018
Bandana: Using Non-volatile Memory for Storing Deep Learning Models
Typical large-scale recommender systems use deep learning models that ar...
research
∙
09/12/2018
Improved Basic Block Reordering
Basic block reordering is an important step for profile-guided binary op...
research
∙
08/31/2018
Queue Layouts of Planar 3-Trees
A queue layout of a graph G consists of a linear order of the vertices o...
research
∙
03/27/2018
On Dispersable Book Embeddings
In a dispersable book embedding, the vertices of a given graph G must be...
research
∙
09/01/2017
Mixed Linear Layouts of Planar Graphs
A k-stack (respectively, k-queue) layout of a graph consists of a total ...
research
∙
12/05/2012