activity
20082026
most citedMulti-Objective Model Checking of Markov Decision Processes

138 citations · 191 across the 22 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2020★ 22 cited

Planar Graphs that Need Four Pages

Mihalis Yannakakis

We show that there are planar graphs that require four pages in any book embedding.

math.CO2016

Doubly Balanced Connected Graph Partitioning

Saleh Soltan, Mihalis Yannakakis, Gil Zussman

We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let be a connected graph with a weight (supply/demand) function $p:V\rightarrow \{…