EPrints submitted by Gregory Gutin

Number of EPrints submitted by this user: 56

Kernels in planar digraphs
Gregory Gutin, Ton KLoks, Chuan Min Lee and Anders Yeo
Journal of Computer and System Sciences Volume 71, pp. 174-184, 2005.

Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey-Hafshejani, Anders Yeo and Michael Tso
Discrete Applied Mathematics Volume to appear, 2005.

Batched Bin Packing
Gregory Gutin, Tommy Jensen and Anders Yeo
Discrete Optimization Volume 2, pp. 71-82, 2005.

Further Extension of TSP Assign Neighborhood
Gregory Gutin and Fred Glover
Journal of Heuristics Volume 11, pp. 501-505, 2005.

Optimal on-line bin packing with two item sizes
Gregory Gutin, Tommy Jensen and Anders Yeo
Algorithmic Oper. Research Volume to apper, 2006.

The Linear Arrangement Problem Parameterized Above Guaranteed Value
Gregory Gutin, Arash Rafiey-Hafshejani, Stefan Szeider and Anders Yeo
submitted 2005.

Mediated Digraphs and Quantum Nonlocality
Gregory Gutin, Nick Jones, Arash Rafiey, Simone Severini and Anders Yeo
Discrete Applied Mathematics Volume 150, pp. 41-50, 2005.

Note on Upper Bounds for TSP Domination Number
Gregory Gutin, Angela Koller and Anders Yeo
Algorithmic Oper. Research Volume to appear, 2006.

Minimum Cost and List Homomorphisms to Semicomplete Digraphs
Gregory Gutin, Arash Rafiey and Anders Yeo
Discrete Applied Mathematics 2005.

The Linear Arrangement Problem Parameterized Above Guaranteed Value
Gregory Gutin, Arash Rafiey, Stefan Szeider and Anders Yeo
Theory of Computing Systems Volume to appear, 2005.

Optimal on-line bin packing with two item sizes
Gregory Gutin, Tommy Jensen and Anders Yeo
Algorithmic Oper. Res. Volume 1, pp. 72-78, 2006.

Tolerance-based greedy algorithms for the traveling salesman problem.
D. Ghosh, B. Goldengorin, G. Gutin and G. Jaeger
Communications in DQM Volume to appear, 2007.

Fixed-Parameter Complexity of Minimum Profile Problems.
G. Gutin, S. Szeider and A. Yeo
In: 2nd International Workshop on Parameterized and Exact Computation, 13 Sept - 15 Sept, 2006, Zurich, Switzerland.

Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
G. Gutin, B. Goldengorin and J. Huang
In: 4th Workshop on Approximation and Online Algorithms, 13 Sept - 15 Sept, 2006, Zurich, Switzerland.

The Greedy Algorithm for the Symmetric TSP
G. Gutin and A. Yeo
Algorithmic Oper. Research Volume to appear, 2005.

Dichotomy for Minimum Cost Graph Homomorphisms
G. Gutin, P. Hell, A. Rafiey and A. Yeo
Europ. Journal Combinatorics Volume to appear, 2006.

Hamilton Cycles in Digraphs of Unitary Matrices
G. Gutin, A. Rafiey, S. Severini and A. Yeo
Discrete Math. Volume to appear, 2004.

Domination analysis for minimum multiprocessor scheduling
G. Gutin, T. Jensen and A. Yeo
Discrete Applied Mathematics Volume to appear, 2003.

Finding a cheapest cycle in a quasi-transitive digraph with real-valued vertex costs
J. Bang-Jensen, G. Gutin and A. Yeo
Disrete Optimization Volume 3, pp. 86-94, 2004.

Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops
EJ Kim and G Gutin
SIAM J. Discrete Mathematics Volume submitted, 2006.

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
G Gutin, A Rafiey and A Yeo
SIAM J. Discrete Mathematics 2006.

A memetic algorithm for the generalized traveling salesman problem
Gregory Gutin, D Karapetyan and N Krasnogor
In: NICSO 2007, November 8-10, 2007, Sicily, Italy.

Better Algorithms and Bounds for Directed Maximum Leaf Problems
N Alon, F Fomin, Gregory Gutin, M Krivelevich and S Saurabh
In: FSTTCS 2007, 12--14 December 2007, India.

An algorithm for finding connected convex subgraphs of an acyclic digraph
Gregory Gutin, A Johnstone, J Reddington, E Scott, A Soleimanfallah and A Yeo
In: ACiD 2007, Monday 17 September - Wednesday 19 September 2007, Durham, UK.

Parameterized Algorithms for Directed Maximum Leaf Problems
N Alon, F Fomin, Gregory Gutin, M Krivelevich and S Saurabh
In: ICALP 2007, 9–13 July 2007, Wrocław, Poland.

Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem.
N. Cohen, F. Fomin, Gregory Gutin, E.J. Kim, S. Saurabh and A. Yeo
COCOON'09 2009.

Minimum Leaf Out-branching and Related Problems
Gregoy Gutin, I. Razgon and E.J. Kim
Discrete AppliedMathematics 2008.

Generalized Traveling Salesman Problem Reduction Algorithms
Gregory Gutin and D. Karapetyan
Algoithmic Operations Research 2008.

A Memetic Algorithm for the Generalized Traveling Salesman Problem
Gregory Gutin and D. Karapetyan
Natural Computing 2008.

Algorithms for generating convex sets in acyclic digraphs
P. Balister, S. Gerke, Gregory Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah and A. Yeo
Discrete Algorithms 2008.

On the number of connected convex subgraphs of a connected acyclic digraph
Gregory Gutin and A. Yeo
Discrete Applied Mathematics Volume 157, pp. 1660-1662, 2009.

A Selection of Useful Theoretical Tools for the Design and Analysis of Optimization Heuristics
Gregory Gutin and D. Karapetyan
Memetic Computing Volume 1, pp. 25-34, 2009.

Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
Gregory Gutin and D. Karapetyan
In: Greedy Algorithms (2008) IN-TECH .

Domination Analysis in Combinatorial Optimization
Gregory Gutin
In: Encyclopedia of Optimization, 2nd Edition (2009) Springer , USA , pp. 792-802.

Traveling Salesman Problem
Gregory Gutin
In: Encyclopedia of Optimization, 2nd Edition (2009) Springer , USA , pp. 3935-3944.

FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
J. Daligault, G. Gutin, E.J. Kim and A. Yeo
J. Comput. Sys. Sci. Volume 76, pp. 144-152, 2010.

Solving MAX-$r$-SAT above a Tight Lower Bound
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider and Anders Yeo
In: SODA 2010, USA(2010).

Fixed-parameter Algorithms in Analysis of Heuristics for Extracting Pure Networks in Linear Programs
Gregory Gutin, Daniel Karapetyan and Igor Razgon
In: IWPEC 2009, Denmark(2010).

A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds
Gregory Gutin, Eun Jung Kim, Stefan Szeider and Anders Yeo
In: IWPEC 2010, Denmark(2010).

Better than optimal: fast identification of custom instruction candidates
J. Reddington, G. Gutin, A. Yeo, A. Johnstone and E. Scott
In: 7th IEEE/IFIP International Conference on Embedded and Ubiqutious Computing(2009).

A Memetic Algorithm for the Multidimensional Assignment Problem
Gregory Gutin and Daniel Karapetyan
In: Stochastic Local Search Workshop 2009(2009).

Note on Max Lin-2 above Average
R. Crowston, G. Gutin and M. Jones
IPL 2009.

Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized Above Average
R. Crowston, G. Gutin, M. Jones, E.J. Kim and I. Ruzsa
Algorithmica 2010.

Note on Maximal Bisection above Tight Lower Bound
G. Gutin and A. Yeo
Inform. Proc. Letters Volume To appear, 2010.

A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
D. Karapetyan and G. Gutin
Evol. Comput. 2010.

A characterization of horizontal visibility graphs and combinatorics on words
G. Gutin, T. Mansour and S. Severini
Physica A: Statistical Mechanics and its Applications 2010.

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Vertices
G. Gutin, L. van Iersel, M. Mnich and A. Yeo
J. Comput. Syst. Sci. 2010.

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Application.
R. Crowston, G. Gutin, M. Jones and A. Yeo
In: IPEC 2010, DEc 2010, India.

Parameterized Complexity of MaxSat Above Average
R. Crowston, G. Gutin, M. Jones, V. Raman and S. Saurabh
In: LATIN 2012, Arequipa, Peru(2012).

A New Bound for $3$-Satisfiable MaxSat and its Algorithmic Application
G. Gutin, M. Jones and A. Yeo
In: FCT 2011, Oslo, Norway(2011).

Simultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average
R. Crowston, M. Fellows, G. Gutin, M. Jones, F. Rosamond, S. Thomasse and A. Yeo
In: FSTTCS 2011, India(2011).

Parameterized eulerian strong component arc deletion problem on tournaments
R. Crowston, G. Gutin, M. Jones and A. Yeo
Inform. Proc. Lett. Volume 112, pp. 249-251, 2012.

(Non-)existence of Polynomial Kernels for the Test Cover Problem
G Gutin, G. Muciaccia and A. Yeo
Inform. Proc. Lett. Volume 113, pp. 123-126, 2013.

Fixed-parameter tractability of satisfying beyond the number of variables
R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh and A. Yeo
Algorithmica 2012.

Note on Large Subsets of Binary Vectors with Similar Distances
G. Gutin and M. Jones
SIAM J. Discrete Math. Volume 26, Number 3, pp. 1108-1111, 2012.

Hypercontractive inequality for pseudo-boolean functions of bounded Fourier width
G. Gutin and A. Yeo
Discrete Appl. Math. Volume 160, pp. 2323-2328, 0012.