( en | de | ru )

 

Disambiguation of "Karakostas, George"

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of intersecting finite state automata and N L versus N P.

, , and . Theor. Comput. Sci., 302 (1-3): 257-274 (2003)

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. You can also use the button next to the name to display some publications already assigned to the person.

Vassileios Karakostas

Giannes Karakostas

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

Andrew George

George Teodoru

 

Other publications of authors with the same name

General Pseudo-random Generators from Weaker Models of Computation.. ISAAC, volume 5878 of Lecture Notes in Computer Science, page 1094-1103. Springer, (2009)Approximation Schemes for Minimum Latency Problems., and . STOC, page 688-693. ACM, (1999)A 2 + epsilon approximation algorithm for the k-MST problem., and . Math. Program., 107 (3): 491-504 (2006)Emergency Connectivity in Ad-hoc Networks with Selfish Nodes., and . Algorithmica, 68 (2): 358-389 (2014)Fractional Packing and Covering Problems.. Encyclopedia of Algorithms, (2016)A 2+epsilon approximation algorithm for the k-MST problem., and . SODA, page 754-759. ACM/SIAM, (2000)A Better Approximation Ratio for the Vertex Cover Problem.. ICALP, volume 3580 of Lecture Notes in Computer Science, page 1043-1050. Springer, (2005)Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands., and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 23-32. Springer, (2006)The Efficiency of Optimal Taxes., and . CAAN, volume 3405 of Lecture Notes in Computer Science, page 3-12. Springer, (2004)On the complexity of intersecting finite state automata and N L versus N P., , and . Theor. Comput. Sci., 302 (1-3): 257-274 (2003)