( en | de | ru )

 

Disambiguation of "Ageev, A."

Author of the publication

copydeleteadd this publication to your clipboard
Joint LIGO and TAMA300 search for gravitational waves from inspiralling neutron star binaries

, , , , , , , , , , and . Phys. Rev. D, (2006)

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.

Anton Ageev

R. A. A. Bowler

°Ake °Akerström

Mohamed A A Anndif

Eltohamy A A Yousef

 

Other publications of authors with the same name

Joint LIGO and TAMA300 search for gravitational waves from inspiralling neutron star binaries, , , , , , , , , and 1 other author(s). Phys. Rev. D, (2006)Setting upper limits on the strength of periodic gravitational waves from PSR $J1939+2134$ using the first science data from the GEO 600 and LIGO detectors, , , , , , , , , and 17 other author(s). Phys. Rev. D, 69 (8): 082004 (April 2004)arXiv:gr-qc/0308050.Analysis of LIGO data for gravitational waves from binary neutron stars, , , , , , , , , and 17 other author(s). Phys. Rev. D, 69 (12): 122001 (June 2004)arXiv:gr-qc/0308069.E-Government Services: Comparing Real and Expected User Behavior., , , and . Business Process Management Workshops, volume 308 of Lecture Notes in Business Information Processing, page 484-496. Springer, (2017)Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem., , and . SIAM J. Discret. Math., 18 (1): 207-217 (2004)On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.. ESA, volume 1643 of Lecture Notes in Computer Science, page 490-497. Springer, (1999)Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines., and . DOOR (Supplement), volume 1623 of CEUR Workshop Proceedings, page 325-335. CEUR-WS.org, (2016)A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.. WAOA, volume 4927 of Lecture Notes in Computer Science, page 55-66. Springer, (2007)A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts., , and . SIAM J. Discret. Math., 14 (2): 246-255 (2001)Every circle graph of girth at least 5 is 3-colourable.. Discret. Math., 195 (1-3): 229-233 (1999)