E. M. Arkin and R. Hassin, A note on orientations of mixed graphs, Discrete Applied Mathematics, vol.116, issue.3, pp.271-278, 2002.
DOI : 10.1016/S0166-218X(01)00228-1

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4

B. Dorn, F. Huffner, D. Kruger, R. Niedermeier, and J. Uhlmann, Exploiting bounded signal flow for graph orientation based on cause-effect pairs, Algorithms for Molecular Biology, vol.6, issue.1, p.21, 2011.
DOI : 10.1089/cmb.2009.0170

M. Elberfeld, D. Segev, C. R. Davidson, D. Silverbush, and R. Sharan, Approximation algorithms for orienting mixed graphs, Proc. CPM, pp.416-428, 2011.

S. Fields and O. Song, A novel genetic system to detect protein???protein interactions, Nature, vol.340, issue.6230, pp.245-246, 1989.
DOI : 10.1038/340245a0

I. Gamzu, D. Segev, and R. Sharan, Improved Orientations of Physical Networks, Proc. WABI, pp.215-225, 2010.
DOI : 10.1007/978-3-642-15294-8_18

R. Hassin and N. Megiddo, On orientations and shortest paths, Linear Algebra and its Applications, vol.114, issue.115, pp.589-602, 1989.
DOI : 10.1016/0024-3795(89)90481-3

U. Lucia, Probability, ergodicity, irreversibility and dynamical systems, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.32, issue.14, pp.1089-1104, 2008.
DOI : 10.1103/PhysRevLett.74.2694

A. Medvedovsky, V. Bafna, U. Zwick, and R. Sharan, An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks, Proc. WABI, pp.222-232, 2008.
DOI : 10.1007/978-3-540-87361-7_19

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Proc. STOC, pp.229-234, 1988.
DOI : 10.1016/0022-0000(91)90023-x
URL : http://doi.org/10.1016/0022-0000(91)90023-x

A. Paz and S. Moran, Non deterministic polynomial optimization problems and their approximations, Theoretical Computer Science, vol.15, issue.3, pp.251-277, 1981.
DOI : 10.1016/0304-3975(81)90081-5

R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.475-484, 1997.
DOI : 10.1145/258533.258641

D. Silverbush, M. Elberfeld, and R. Sharan, Optimally Orienting Physical Networks, Journal of Computational Biology, vol.18, issue.11, pp.1437-1448, 2011.
DOI : 10.1089/cmb.2011.0163
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.204.8067

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984.
DOI : 10.1016/0166-218X(84)90081-7

C. Yeang, T. Ideker, and T. Jaakkola, Physical Network Models, Journal of Computational Biology, vol.11, issue.2-3, pp.243-262, 2004.
DOI : 10.1089/1066527041410382