default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Grigoriev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j37]Katrin Casel
, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69(4): 937-980 (2023)- [i7]Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev:
Envy-free dynamic pricing schemes. CoRR abs/2301.01529 (2023) - 2022
- [j36]Aida Abiad, Merit Geldmacher, Alexander Grigoriev:
The Kaleidoscopic Game of Life. Complex Syst. 31(1): 1-58 (2022) - [j35]Moritz Buchem, Julian Arthur Pawel Golak, Alexander Grigoriev:
Vessel velocity decisions in inland waterway transportation under uncertainty. Eur. J. Oper. Res. 296(2): 669-678 (2022) - [j34]Alexander Grigoriev, Olga Mondrus:
Managing academic performance by optimal resource allocation. Scientometrics 127(5): 2433-2453 (2022) - 2021
- [j33]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83(6): 1734-1749 (2021) - [j32]Christof Defryn, Julian Arthur Pawel Golak, Alexander Grigoriev, Veerle Timmermans:
Inland waterway efficiency through skipper collaboration and joint speed optimization. Eur. J. Oper. Res. 292(1): 276-285 (2021) - [j31]Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk:
Cyclic lot-sizing problems with sequencing costs. J. Sched. 24(2): 123-135 (2021) - [j30]Aida Abiad, Boris Brimkov, Alexander Grigoriev:
On the status sequences of trees. Theor. Comput. Sci. 856: 110-120 (2021) - 2020
- [j29]Aida Abiad, Alexander Grigoriev, Stefanie Niemzok:
Printed circuit boards isomorphism: An experimental study. Comput. Ind. Eng. 148: 106715 (2020) - [c28]Alexander Grigoriev:
Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs. Treewidth, Kernels, and Algorithms 2020: 78-88 - [c27]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. WG 2020: 80-91
2010 – 2019
- 2019
- [c26]Christof Defryn, Julian Arthur Pawel Golak, Alexander Grigoriev, Veerle Timmermans:
Inland Waterway Efficiency Through Skipper Collaboration and Joint Speed Optimization. MOTOR 2019: 202-217 - [c25]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - [i6]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. CoRR abs/1904.03117 (2019) - 2018
- [i5]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing obnoxious facilities on a graph. CoRR abs/1811.08918 (2018) - 2017
- [j28]André Berger, Alexander Grigoriev, Andrej Winokurow:
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. Comput. Optim. Appl. 68(3): 661-669 (2017) - [j27]André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow:
Location, pricing and the problem of Apollonius. Optim. Lett. 11(8): 1797-1805 (2017) - [c24]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS 2017: 30:1-30:15 - [i4]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR abs/1706.05906 (2017) - 2016
- [c23]André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow:
Location, Pricing and the Problem of Apollonius. DOOR 2016: 563-569 - [c22]André Berger, Alexander Grigoriev, Andrej Winokurow:
A PTAS for the Cluster Editing Problem on Planar Graphs. WAOA 2016: 27-39 - 2015
- [j26]Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
A Note on the Minimum H-Subgraph Edge Deletion. Int. J. Found. Comput. Sci. 26(3): 399-412 (2015) - [j25]Alexander Grigoriev, Steven Kelk, Nela Lekic:
On Low Treewidth Graphs and Supertrees. J. Graph Algorithms Appl. 19(1): 325-343 (2015) - [j24]André Berger, Alexander Grigoriev, Ralf Peeters, Natalya Usotskaya:
On Time-Optimal Trajectories in Non-Uniform Mediums. J. Optim. Theory Appl. 165(2): 586-626 (2015) - 2014
- [j23]André Berger, Alexander Grigoriev, Ruben van der Zwaan:
Complexity and approximability of the k-way vertex cut. Networks 63(2): 170-178 (2014) - [j22]André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan:
Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42(2): 166-172 (2014) - [c21]Alexander Grigoriev, Steven Kelk, Nela Lekic:
On Low Treewidth Graphs and Supertrees. AlCoB 2014: 71-82 - [c20]Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk:
High Multiplicity Scheduling with Switching Costs for Few Products. OR 2014: 437-443 - [c19]Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos:
Bidimensionality of Geometric Intersection Graphs. SOFSEM 2014: 293-305 - [i3]Alexander Grigoriev, Steven Kelk, Nela Lekic:
On low treewidth graphs and supertrees. CoRR abs/1402.7224 (2014) - 2013
- [i2]Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos:
Bidimensionality of Geometric Intersection Graphs. CoRR abs/1308.6166 (2013) - 2012
- [j21]Alexander Grigoriev, Bert Marchal, Natalya Usotskaya, Ioan Todinca:
A note on planar graphs with large width parameters and small grid-minors. Discret. Appl. Math. 160(7-8): 1262-1269 (2012) - [j20]Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld:
Dynamic pricing problems with elastic demand. Oper. Res. Lett. 40(3): 175-179 (2012) - 2011
- [j19]Alexander Grigoriev, Joyce van Loon, Marc Uetz:
On the complexity of a bundle pricing problem. 4OR 9(3): 255-260 (2011) - [j18]André Berger, Alexander Grigoriev, Joyce van Loon:
Price strategy implementation. Comput. Oper. Res. 38(2): 420-426 (2011) - [j17]Alexander Grigoriev:
Tree-width and large grid minors in planar graphs. Discret. Math. Theor. Comput. Sci. 13(1): 13-20 (2011) - [j16]Alexander Grigoriev, Joris van de Klundert:
A note on the integrality gap of an ILP formulation for the periodic maintenance problem. Oper. Res. Lett. 39(4): 252-254 (2011) - [c18]Ruben van der Zwaan, André Berger, Alexander Grigoriev:
How to Cut a Graph into Many Pieces. TAMC 2011: 184-194 - 2010
- [j15]Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva:
The Valve Location Problem in Simple Network Topologies. INFORMS J. Comput. 22(3): 433-442 (2010) - [c17]Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. SOFSEM 2010: 452-464 - [c16]Alexander Grigoriev, Joyce van Loon, Marc Uetz:
On the Complexity of the Highway Pricing Problem. SOFSEM 2010: 465-476
2000 – 2009
- 2009
- [j14]Alexander Grigoriev, Nadejda V. Grigorieva:
The valve location problem: Minimizing environmental damage of a spill in long oil pipelines. Comput. Ind. Eng. 57(3): 976-982 (2009) - [j13]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42(9): 939-951 (2009) - [j12]Alexander Grigoriev, Marc Uetz:
Scheduling jobs with time-resource tradeoff via nonlinear programming. Discret. Optim. 6(4): 414-419 (2009) - [j11]Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
On planar graphs with large tree-width and small grid minors. Electron. Notes Discret. Math. 32: 35-42 (2009) - [j10]Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
Optimal pricing of capacitated networks. Networks 53(1): 79-87 (2009) - [c15]Alexander Grigoriev, René Sitters:
Connected Feedback Vertex Set in Planar Graphs. WG 2009: 143-153 - 2008
- [j9]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008) - [j8]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008) - [c14]Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The Valve Location Problem in Simple Network Topologies. WG 2008: 55-65 - [c13]Alexander Grigoriev, Joyce van Loon, Marc Uetz:
Algorithms for Optimal Price Regulations. WINE 2008: 362-373 - 2007
- [j7]Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica 49(1): 1-11 (2007) - [j6]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
Machine scheduling with resource dependent processing times. Math. Program. 110(1): 209-228 (2007) - [c12]Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The valve location problem. CTW 2007: 13-16 - [c11]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - [c10]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Bundle Pricing with Comparable Items. ESA 2007: 475-486 - 2006
- [j5]Corinne Feremans, Alexander Grigoriev, René Sitters:
The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4): 319-329 (2006) - [j4]Alexander Grigoriev, Joris van de Klundert:
On the high multiplicity traveling salesman problem. Discret. Optim. 3(1): 50-62 (2006) - [j3]Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma:
Modeling and solving the periodic maintenance problem. Eur. J. Oper. Res. 172(3): 783-797 (2006) - [c9]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. APPROX-RANDOM 2006: 140-151 - [c8]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA 2006: 69-82 - [c7]Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
How to Sell a Graph: Guidelines for Graph Retailers. WG 2006: 125-136 - 2005
- [j2]Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert:
A Framework for the Complexity of High-Multiplicity Scheduling Problems. J. Comb. Optim. 9(3): 313-323 (2005) - [c6]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. ESA 2005: 391-402 - [c5]Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT 2005: 378-387 - [c4]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. IPCO 2005: 182-195 - [c3]Alexander Grigoriev, Marc Uetz:
Scheduling Parallel Jobs with Linear Speedup. WAOA 2005: 203-215 - [i1]Corinne Feremans, Alexander Grigoriev:
Approximation schemes for the generalized geometric problems with geographic clustering. EuroCG 2005: 101-102 - 2004
- [j1]Alexander Grigoriev, Gerhard J. Woeginger:
Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Informatica 41(2-3): 83-97 (2004) - [c2]Alexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou:
Pricing Network Edges to Cross a River. WAOA 2004: 140-153 - 2002
- [c1]Alexander Grigoriev, Gerhard J. Woeginger:
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. ISAAC 2002: 381-390
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
