Yahav Nussbaum

Ph.D. Student
School of Computer Science
Tel Aviv University
nuss at post:tau:ac:il

Teaching

My publications

A Simpler Linear-Time Recognition of Circular-Arc Graphs
Haim Kaplan and Yahav Nussbaum
In 10th Scandinavian Workshop on Algorithm Theory (SWAT) 2006
Lecture Notes in Computer Science 4059 (2006), pp. 41-52.

Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Haim Kaplan and Yahav Nussbaum
In 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2006
Lecture Notes in Computer Science 4271 (2006), pp. 289-300.

Journal version:
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Haim Kaplan and Yahav Nussbaum
Discrete Applied Mathematics 157 (2009), pp. 3216-3230

From a circular-arc model to a proper circular-arc model
Yahav Nussbaum
In 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2008
Lecture Notes in Computer Science 5344 (2008), pp. 324-335.

Linear-time recognition of probe interval graphs
Ross McConnell and Yahav Nussbaum
In Algorithms - ESA 2009, 17th Annual European Symposium
Lecture Notes in Computer Science 5757 (2009), pp. 349-360.

Maximum Flow in Directed Planar Graphs with Vertex Capacities
Haim Kaplan and Yahav Nussbaum
In Algorithms - ESA 2009, 17th Annual European Symposium
Lecture Notes in Computer Science 5757 (2009), pp. 397-407.