|
Search the dblp DataBase
Alexander Grigoriev:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:140-151 [Conf]
- Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
Treewidth Lower Bounds with Brambles. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:391-402 [Conf]
- Alexander Grigoriev, Hans L. Bodlaender
Algorithms for Graphs Embeddable with Few Crossings Per Edge. [Citation Graph (0, 0)][DBLP] FCT, 2005, pp:378-387 [Conf]
- Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:182-195 [Conf]
- Alexander Grigoriev, Gerhard J. Woeginger
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. [Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:381-390 [Conf]
- Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. [Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:69-82 [Conf]
- Alexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou
Pricing Network Edges to Cross a River. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:140-153 [Conf]
- Alexander Grigoriev, Marc Uetz
Scheduling Parallel Jobs with Linear Speedup. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:203-215 [Conf]
- Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
How to Sell a Graph: Guidelines for Graph Retailers. [Citation Graph (0, 0)][DBLP] WG, 2006, pp:125-136 [Conf]
- Corinne Feremans, Alexander Grigoriev, René Sitters
The geometric generalized minimum spanning tree problem with grid clustering. [Citation Graph (0, 0)][DBLP] 4OR, 2006, v:4, n:4, pp:319-329 [Journal]
- Alexander Grigoriev, Gerhard J. Woeginger
Project scheduling with irregular costs: complexity, approximability, and algorithms. [Citation Graph (0, 0)][DBLP] Acta Inf., 2004, v:41, n:2-3, pp:83-97 [Journal]
- Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert
A Framework for the Complexity of High-Multiplicity Scheduling Problems. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:9, n:3, pp:313-323 [Journal]
- Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
Machine scheduling with resource dependent processing times. [Citation Graph (0, 0)][DBLP] Math. Program., 2007, v:110, n:1, pp:209-228 [Journal]
- Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma
Modeling and solving the periodic maintenance problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:172, n:3, pp:783-797 [Journal]
- Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
Bundle Pricing with Comparable Items. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:475-486 [Conf]
Approximation schemes for the generalized geometric problems with geographic clustering. [Citation Graph (, )][DBLP]
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. [Citation Graph (, )][DBLP]
On the Complexity of the Highway Pricing Problem. [Citation Graph (, )][DBLP]
The Valve Location Problem in Simple Network Topologies. [Citation Graph (, )][DBLP]
Connected Feedback Vertex Set in Planar Graphs. [Citation Graph (, )][DBLP]
Algorithms for Optimal Price Regulations. [Citation Graph (, )][DBLP]
The valve location problem. [Citation Graph (, )][DBLP]
Optimal bundle pricing for homogeneous items. [Citation Graph (, )][DBLP]
Algorithms for Graphs Embeddable with Few Crossings per Edge. [Citation Graph (, )][DBLP]
Treewidth Lower Bounds with Brambles. [Citation Graph (, )][DBLP]
On the minimum corridor connection problem and other generalized geometric problems. [Citation Graph (, )][DBLP]
Price strategy implementation. [Citation Graph (, )][DBLP]
Search in 0.084secs, Finished in 0.085secs
|