Alexander Grigoriev

According to our database1, Alexander Grigoriev
  • authored at least 52 papers between 2002 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
A PTAS for the Cluster Editing Problem on Planar Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Location, Pricing and the Problem of Apollonius.
Proceedings of the Discrete Optimization and Operations Research, 2016

2015
On Time-Optimal Trajectories in Non-Uniform Mediums.
J. Optimization Theory and Applications, 2015

On Low Treewidth Graphs and Supertrees.
J. Graph Algorithms Appl., 2015

A Note on the Minimum H-Subgraph Edge Deletion.
Int. J. Found. Comput. Sci., 2015

2014
Scheduling unit-length jobs with precedence constraints of small height.
Oper. Res. Lett., 2014

Complexity and approximability of the k-way vertex cut.
Networks, 2014

On low treewidth graphs and supertrees.
CoRR, 2014

Bidimensionality of Geometric Intersection Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

High Multiplicity Scheduling with Switching Costs for Few Products.
Proceedings of the Operations Research Proceedings 2014, 2014

On Low Treewidth Graphs and Supertrees.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013
Bidimensionality of Geometric Intersection Graphs.
CoRR, 2013

2012
Dynamic pricing problems with elastic demand.
Oper. Res. Lett., 2012

A note on planar graphs with large width parameters and small grid-minors.
Discrete Applied Mathematics, 2012

2011
A note on the integrality gap of an ILP formulation for the periodic maintenance problem.
Oper. Res. Lett., 2011

Tree-width and large grid minors in planar graphs.
Discrete Mathematics & Theoretical Computer Science, 2011

Price strategy implementation.
Computers & OR, 2011

On the complexity of a bundle pricing problem.
4OR, 2011

How to Cut a Graph into Many Pieces.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
The Valve Location Problem in Simple Network Topologies.
INFORMS Journal on Computing, 2010

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Complexity of the Highway Pricing Problem.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009
Optimal pricing of capacitated networks.
Networks, 2009

On planar graphs with large tree-width and small grid minors.
Electronic Notes in Discrete Mathematics, 2009

Scheduling jobs with time-resource tradeoff via nonlinear programming.
Discrete Optimization, 2009

On the minimum corridor connection problem and other generalized geometric problems.
Comput. Geom., 2009

The valve location problem: Minimizing environmental damage of a spill in long oil pipelines.
Computers & Industrial Engineering, 2009

Connected Feedback Vertex Set in Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Optimal bundle pricing with monotonicity constraint.
Oper. Res. Lett., 2008

Treewidth Lower Bounds with Brambles.
Algorithmica, 2008

Algorithms for Optimal Price Regulations.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

The Valve Location Problem in Simple Network Topologies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007
Machine scheduling with resource dependent processing times.
Math. Program., 2007

Algorithms for Graphs Embeddable with Few Crossings per Edge.
Algorithmica, 2007

Bundle Pricing with Comparable Items.
Proceedings of the Algorithms, 2007

Optimal bundle pricing for homogeneous items.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

The valve location problem.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Modeling and solving the periodic maintenance problem.
European Journal of Operational Research, 2006

On the high multiplicity traveling salesman problem.
Discrete Optimization, 2006

The geometric generalized minimum spanning tree problem with grid clustering.
4OR, 2006

How to Sell a Graph: Guidelines for Graph Retailers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.
Proceedings of the Approximation, 2006

2005
A Framework for the Complexity of High-Multiplicity Scheduling Problems.
J. Comb. Optim., 2005

Scheduling Parallel Jobs with Linear Speedup.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Algorithms for Graphs Embeddable with Few Crossings Per Edge.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Approximation schemes for the generalized geometric problems with geographic clustering.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Treewidth Lower Bounds with Brambles.
Proceedings of the Algorithms, 2005

2004
Project scheduling with irregular costs: complexity, approximability, and algorithms.
Acta Inf., 2004

Pricing Network Edges to Cross a River.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2002
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002


  Loading...