TU Berlin

Publications

Page Content

to Navigation

Journal Publications

Disser, Y. and Skutella, M.
The Simplex Algorithm Is NP-Mighty.
ACM Transactions on Algorithms, Vol. 15, pp. 5:1–5:19, 2019.


Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F.
Distance-Preserving Graph Contractions.
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.


Disser, Y. and Matuschke, J.
Degree-constrained orientations of embedded graphs.
Journal of Combinatorial Optimization, Vol. 3, pp. 758–773, 2016.  [pdf]


Disser, Y., Feldmann, A., Klimm, M. and Mihalák, M.
Improving the Hk-bound on the price of stability in undirected Shapley network design games.
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.  [pdf]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Mapping Simple Polygons: The Power of telling Convex from Reflex.
ACM Transactions on Algorithms, Vol. 11, pp. 33(16), 2015.  [pdf]


Dereniowski, D., Disser, Y., Kosowski, A., Pająk, D. and Uznański, P.
Fast collaborative graph exploration.
Information and Computation, Vol. 243, pp. 37–49, 2015.  [pdf]


Disser, Y., Ghosh, S. K., Mihalák, M. and Widmayer, P.
Mapping a polygon with holes using a compass.
Theoretical Computer Science, Vol. 553, pp. 106–113, 2014.  [pdf]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Mapping Simple Polygons: How Robots Benefit from Looking Back.
Algorithmica, Vol. 65, pp. 43–59, 2013.  [pdf]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons.
Discrete Applied Mathematics, Vol. 161, pp. 1287–1307, 2013.  [pdf]


Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P.
Reconstructing Visibility Graphs with Simple Robots.
Theoretical Computer Science, Vol. 444, pp. 52–59, 2012.  [pdf]


Disser, Y., Mihalák, M. and Widmayer, P.
A polygon is determined by its angles.
Computational Geometry: Theory and Applications, Vol. 44, pp. 418–426, 2011.  [pdf]


Wilms, J., Disser, Y., Alber, G. and Percival, I. C.
Local Realism, Detection Efficiencies, and Probability Polytopes.
Physical Review A, Vol. 73, pp. 032116(8), 2008.  [pdf]


Conference Publications

Degree-constrained orientations of embedded graphs
Citation key DisserMatuschke2012
Author Disser, Yann and Matuschke, Jannik
Title of Book Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC)
Pages 506-516
Year 2012
ISBN 978-3-642-35260-7
Editor Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee
Publisher Springer
Series Lecture Notes in Computer Science
Abstract We consider the problem of orienting the edges of an embedded graph in such a way that the in-degrees of both the nodes and faces meet given values. We show that if g is the genus of the embedding, the number of feasible solutions is bounded by 4^g and all solutions can be determined within time O(4^g |E|^2 + |E|^3). In particular, for planar graphs the solution is unique if it exists and for every fixed genus there is a polynomial time algorithm to find all solutions. We show that the problem becomes NP-hard if no exact values but only upper and lower bounds on the in-degrees are specified.
Link to publication Link to original publication Download Bibtex entry

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe