Publications

International refereed journals

 

  1. Berger A., Grigoriev A., Peeters R., Usotskaya N. On Time-Optimal Trajectories in Non-Uniform Mediums. Accepted in Journal of Optimization Theory and Applications, 2014.
  2. Berger A., Grigoriev A., van der Zwaan R. Complexity and Approximability of the k-Way Vertex Cut. Networks 63, No. 2, pp. 170-178, 2014.
  3. Berger A., Grigoriev A., Heggernes P., van der Zwaan R. Scheduling unit-length jobs with precedence constraints of small height. Operations Research Letters 42, No. 2, pp. 166-172, 2014.
  4. Grigoriev A., Marchal B., Todinca I., Usotskaya N. A note on planar graphs with large width-parameters and small grid-minors. Discrete Applied Mathematics 160, No. 7-8, pp. 1262-1269, 2012.
  5. Marban S., van der Zwaan R., Grigoriev A., Hiller B., Vredeveld T. Dynamic pricing problems with elastic demand. Operations Research Letters 40, No. 3, pp. 175-179, 2012.
  6. Grigoriev A., Van De Klundert J. A note on the integrality gap of an ILP formulation to the periodic maintenance problem. Operations Research Letters 39, No. 4, pp. 252-254, 2011.
  7. Grigoriev A. Tree-width and large grid minors in planar graphs. Discrete Mathematics and Theoretical Computer Science 13, No. 1, pp. 13-20, 2011.
  8. Grigoriev A., Van Loon J., Uetz M. On the complexity of a bundle pricing problem. 4OR: A Quarterly Journal of Operations Research 9, No. 3, pp. 255-260, 2011.
  9. Berger A., Grigoriev A., Van Loon J. Price Strategy Implementation. Computers & Operations Research 38, No. 2, pp. 420-426, 2011.
  10. Bodlaender H.L., Grigoriev A., Grigorieva N.V., Hendriks A. The valve location problem in simple network topologies. INFORMS Journal on Computing 22, No. 3, pp. 433–442, 2010.
  11. Grigoriev A., Grigorieva N.V. The valve location problem: Minimizing environmental damage of a spill in long oil pipelines. Computers & Industrial Engineering 57, No. 3, pp. 976-982, 2009.
  12. Grigoriev A., Uetz M. Scheduling jobs with time-resource tradeoff via nonlinear programming. Discrete Optimization 6, No. 4, pp. 414-419, 2009.
  13. Bodlaender H.L., Feremans C., Grigoriev A., Penninkx E., Sitters R., Wolle T. On the minimum corridor connection and other generalized geometric problems. Computational Geometry 42, No. 9, pp. 939-951, 2009.
  14. Grigoriev A., Van Loon J., Sitters R., Uetz M. Optimal pricing of capacitated networks. Networks 53, No. 1, pp. 79-87, 2009.
  15. Bodlaender H.L., Grigoriev A., Koster A.M.C.A. Treewidth lower bounds with brambles. Algorithmica 51, No. 1, pp. 81-98, 2008.
  16. Grigoriev A., Van Loon J., Sviridenko M., Uetz M., Vredeveld T. Optimal Bundle Pricing with Monotonicity Constraint. Operations Research Letters 36, No. 5, pp. pp. 609-614, 2008.
  17. Grigoriev A., Sviridenko M., Uetz M. Machine scheduling with resource dependent processing times. Mathematical Programming 110, No.1, pp. 209-228, 2007.
  18. Bodlaender H.L., Grigoriev A. Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49, No. 1, pp. 1-11, 2007.
  19. Bouhtou M., Grigoriev A., Van Der Kraaij A.F., Van Hoesel S., Spieksma F., Uetz M. Pricing bridges to cross a river. Naval Research Logistics 54, No. 4, pp. 411-420, 2007.
  20. Brauner N., Crama Y., Grigoriev A., Van De Klundert J. Multiplicity and complexity issues in contemporary production scheduling. Statistica Neerlandica 61, No. 1, pp. 75-91, 2007.
  21. Grigoriev A., Van De Klundert J. On the high multiplicity traveling salesman problem. Discrete Optimization 3, No. 1, pp. 50-62, 2006.
  22. Grigoriev A., Van De Klundert J., Spieksma F. Modelling and solving the periodic maintenance problem. European Journal of Operational Research 172, No. 3, pp. 783-797, 2006.
  23. Feremans C., Grigoriev A., Sitters R. The geometric generalized minimum spanning tree problem with grid clustering. 4OR: A Quarterly Journal of Operations Research 4, No. 4, pp. 319-329, 2006.
  24. Brauner N., Crama Y., Grigoriev A., Van De Klundert J. A framework for the complexity of high-multiplicity scheduling problems. Journal of Combinatorial Optimization 9, No. 3, pp. 313-323, 2005.
  25. Grigoriev A., Holthuijsen M., Van De Klundert J. Basic scheduling problems with raw materials constraints. Naval Research Logistics 52, No. 6, pp. 527-535, 2005.
  26. Grigoriev A., Woeginger G. Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Informatica 41, No. 2-3, pp. 83-97, 2004.

 

Proceedings

 

  1. Grigoriev A., Kelk S., Lekic N. On Low Treewidth Graphs and Supertrees. In Algorithms for Computational Biology (AlCoB 2014), A.-H. Dediu et al. (Eds.), Lecture Notes in Bioinformatics 8542, pp. 71-82, 2014.
  2. Grigoriev A., Koutsonas A., Thilikos D.M. Bidimensionality of Geometric Intersection Graphs. In Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), V. Geffert et al. (Eds.), Lecture Notes in Computer Science 8327, pp. 293-305, 2014.
  3. Van der Zwaan R., Berger A., Grigoriev A. How to Cut a Graph into Many Pieces. In Theory and Applications of Models of Computation (TAMC 2011), M. Ogihara and J. Tarui (Eds.), Lecture Notes in Computer Science 6648, pp. 184–194, 2011.
  4. Grigoriev A., Van Loon J., Uetz M. On the Complexity of the Highway Pricing Problem. In Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), J. van Leeuwen et al. (Eds.), Lecture Notes in Computer Science 5901, pp. 465-476, 2010.
  5. Grigoriev A., Marchal B., Usotskaya N. Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. In Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), J. van Leeuwen et al. (Eds.), Lecture Notes in Computer Science 5901, pp. 452-464, 2010.
  6. Grigoriev A., Sitters R. Connected feedback vertex set in planar graphs. In Graph-Theoretic Concepts in Computer Science (WG 2009), Habib M. and Paul C. (Eds.), Lecture Notes in Computer Science 5911, pp. 143-153, 2010.
  7. Grigoriev A., Marchal B., Usotskaya N. On planar graphs with large tree-width and small grid minors. In proceedings of DIMAP workshop on Algorithmic Graph Theory (AGT 2009), Electronic Notes in Discrete Mathematics 32 , pp. 35-42, 2009.
  8. Bodlaender H.L., Grigoriev A., Grigorieva N.V., Hendriks A. The valve location problem in simple network topologies. In Graph-Theoretic Concepts in Computer Science (WG 2008), Broersma H. et al. (Eds.), Lecture Notes in Computer Science 5344, pp. 55-65, 2008.
  9. Grigoriev A., Van Loon J., Uetz M. Algorithms for optimal price regulations. In Internet and Network Economics (WINE 2008), Papadimitriou C. and Zhang S. (Eds.), Lecture Notes in Computer Science 5385, pp. 362-373, 2008.
  10. Grigoriev A., Van Loon J., Sviridenko M., Uetz M., Vredeveld T. Bundle Pricing with Comparable Items. In Algorithms (ESA 2007), Arge L. and Welzl E. (Eds.), Lecture Notes in Computer Science 4698, pp. 475-486, 2007.
  11. Bodlaender H.L., Feremans C., Grigoriev A., Penninkx E., Sitters R., Wolle T. On the minimum corridor connection and other generalized geometric problems. In Approximation and Online Algorithms (WAOA 2006), Erlebach T. and Kaklamanis C. (Eds.), Lecture Notes in Computer Science 4368, pp. 69-82, 2007.
  12. Grigoriev A., Van Loon J., Sitters R., Uetz M. How to sell a graph: Guidelines for graph retailers. In Graph-Theoretic Concepts in Computer Science (WG 2006), Fomin F.V. (Ed.), Lecture Notes in Computer Science 4271, pp. 125-136, 2006.
  13. Grigoriev A., Sviridenko M., Uetz M., LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times. In Approximation, Randomization and Combinatorial Optimization: Algorithms and techniques (APPROX 2006), Diaz J., Jansen K., Rolim J.D.P. and Zwick U. (Eds.), Lecture Notes in Computer Science 4110, pp. 140-151, 2006.
  14. Grigoriev A., Uetz M. Scheduling parallel jobs with linear speedup. In Approximation and Online Algorithms (WAOA 2005), Erlebach T. and Persiano G. (Eds.), Lecture Notes in Computer Science 3879, pp. 203-215, 2006.
  15. Bodlaender H.L., Grigoriev A., Koster A.M.C.A. Treewidth lower bounds with brambles. In Algorithms (ESA 2005), Brodal G.S. and Leonardi S. (Eds.), Lecture Notes in Computer Science 3669, pp. 391-402, 2005.
  16. Bodlaender H.L., Grigoriev A. Algorithms for graphs embeddable with few crossings per edge. In Fundamentals of Computation Theory (FCT 2005), Liskiewicz M. and Reischuk R. (Eds.), Lecture Notes in Computer Science 3623, pp. 378-387, 2005.
  17. Bouhtou M., Grigoriev A., Van Der Kraaij A.F., Van Hoesel S., Uetz M. Pricing network edges to cross a river. In Approximation and Online Algorithms (WAOA 2004), Persiano G. and Solis-Oba R. (Eds.), Lecture Notes in Computer Science 3351, pp. 140-153, 2005.
  18. Grigoriev A., Sviridenko M., Uetz M. Unrelated parallel machine scheduling with resource dependent processing times. In Integer Programming and Combinatorial Optimization (IPCO 2005), Junger M. and Kaibel V. (Eds.), Lecture Notes in Computer Science 3509, pp. 182-195, 2005.
  19. Grigoriev A., Woeginger G. Project scheduling with irregular costs: complexity, approximability, and algorithms. In Algorithms and Computation (ISAAC 2002), Bose P. and Morin P. (Eds.), Lecture Notes in Computer Science 2518, pp. 381-390, 2002.