( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating the minimum cycle mean.

, , , , и . Theor. Comput. Sci., (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Veronika Schleper

Modeling, Analysis and Optimal Control of Gas Pipeline Networks. TU Kaiserslautern, (2009)

Veronika Lange

Veronika Tews

Veronika Nitsche

Veronika Haripyan

 

Другие публикации лиц с тем же именем

Ad Exchange: Envy-Free Auctions with Mediators., , и . WINE, том 9470 из Lecture Notes in Computer Science, стр. 104-117. Springer, (2015)Verbesserte Algorithmen und Bedingte Untere Schranken für Probleme in Formaler Verifikation und Reaktiver Synthese.. Ausgezeichnete Informatikdissertationen, том D-18 из LNI, GI, (2017)Finding 2-edge and 2-vertex strongly connected components in quadratic time., , и . CoRR, (2014)Improved Algorithms for Parity and Streett objectives., , и . Log. Methods Comput. Sci., (2017)Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time., , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 713-724. Springer, (2015)Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs., , , , и . SODA, стр. 1900-1918. SIAM, (2017)Approximating the minimum cycle mean., , , и . GandALF, том 119 из EPTCS, стр. 136-149. (2013)Ad Exchange: Envy-Free Auctions with Mediators., , и . CoRR, (2016)Improved Algorithms for One-Pair and k-Pair Streett Objectives., , и . CoRR, (2014)Truthful unit-demand auctions with budgets revisited., и . Theor. Comput. Sci., (2015)