☰

Grigoriy Gutin - Publications

Affiliations: 
2014 Yeshiva University, New York, NY, United States 
Tree Info Grants Similar researchers Related pubs Distance to... Nearest Nobel PubMed Report error

5/163 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Nandi S, Gutin G, Blackwood CA, Kamatkar NG, Lee KW, Fishell G, Wang F, Goldfarb M, Hébert JM. FGF-dependent, context-driven role for FRS adapters in the early telencephalon. The Journal of Neuroscience : the Official Journal of the Society For Neuroscience. PMID 28483978 DOI: 10.1523/Jneurosci.2931-16.2017  0.608
2009 Paek H, Gutin G, Hébert JM. FGF signaling is strictly required to maintain early telencephalic precursor cell survival. Development (Cambridge, England). 136: 2457-65. PMID 19542358 DOI: 10.1242/Dev.032656  0.657
2007 Fernandes M, Gutin G, Alcorn H, McConnell SK, Hébert JM. Mutations in the BMP pathway in mice support the existence of two molecular classes of holoprosencephaly. Development (Cambridge, England). 134: 3789-94. PMID 17913790 DOI: 10.1242/Dev.004325  0.635
2006 Gutin G, Fernandes M, Palazzolo L, Paek H, Yu K, Ornitz DM, McConnell SK, Hébert JM. FGF signalling generates ventral telencephalic cells independently of SHH. Development (Cambridge, England). 133: 2937-46. PMID 16818446 DOI: 10.1242/Dev.02465  0.589
2006 Tole S, Gutin G, Bhatnagar L, Remedios R, Hébert JM. Development of midline cell types and commissural axon tracts requires Fgfr1 in the cerebrum. Developmental Biology. 289: 141-51. PMID 16309667 DOI: 10.1016/J.Ydbio.2005.10.020  0.46
Low-probability matches (unlikely to be authored by this person)
2002 Gutin G, Yeo A, Zverovich A. Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP Discrete Applied Mathematics. 117: 81-86. DOI: 10.1016/S0166-218X(01)00195-0  0.181
2013 Crampton J, Gutin G. Constraint expressions and workflow satisfiability Proceedings of Acm Symposium On Access Control Models and Technologies, Sacmat. 73-84. DOI: 10.1145/2462410.2462419  0.143
2003 Bang-Jensen J, Gutin G, Yeo A. Steiner Type Problems for Digraphs that are Locally Semicomplete or Extended Semicomplete Journal of Graph Theory. 44: 193-207. DOI: 10.1002/jgt.10140  0.139
2012 Crowston R, Gutin G, Jones M, Yeo A. Parameterized Eulerian strong component arc deletion problem on tournaments Information Processing Letters. 112: 249-251. DOI: 10.1016/j.ipl.2011.11.014  0.123
1999 Glover F, Gutin G, Yeo A, Zverovich A. construction heuristics and domination analysis for the asymmetric tsp Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1668: 85.  0.104
2006 Bang-Jensen J, Gutin G, Yeo A. Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs Discrete Optimization. 3: 86-94. DOI: 10.1016/j.disopt.2005.11.001  0.098
1995 Gutin G. Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs Discrete Mathematics. 141: 153-162. DOI: 10.1016/0012-365X(93)E0195-A  0.087
2015 Crampton J, Gagarin A, Gutin G, Jones M. On the workflow satisfiability problem with class-independent constraints Leibniz International Proceedings in Informatics, Lipics. 43: 66-77. DOI: 10.4230/LIPIcs.IPEC.2015.66  0.085
2005 Blokh D, Gutin G, Yeo A. A problem of finding an acceptable variant in generalized project networks Journal of Applied Mathematics and Decision Sciences. 2005: 75-81. DOI: 10.1155/JAMDS.2005.75  0.084
2015 Cohen D, Crampton J, Gagarin A, Gutin G, Jones M. Algorithms for the workflow satisfiability problem engineered for counting constraints Journal of Combinatorial Optimization. DOI: 10.1007/S10878-015-9877-7  0.083
2001 Gutin G, Yeo A. TSP tour domination and Hamilton cycle decompositions of regular digraphs Operations Research Letters. 28: 107-111. DOI: 10.1016/S0167-6377(01)00053-0  0.079
2006 Gutin G, Jensen T, Yeo A. Domination analysis for minimum multiprocessor scheduling Discrete Applied Mathematics. 154: 2613-2619. DOI: 10.1016/j.dam.2006.02.010  0.077
1999 Bang-Jensen J, Gutin G. On the complexity of hamiltonian path and cycle problems in certain classes of digraphs Discrete Applied Mathematics. 95: 41-60.  0.074
1998 Gutin G, Sudakov B, Yeo A. Note on alternating directed cycles Discrete Mathematics. 191: 101-107.  0.072
2011 Gutin G, Jones M, Yeo A. Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems Theoretical Computer Science. 412: 5744-5751. DOI: 10.1016/j.tcs.2011.06.018  0.072
2009 Gutin G, Yeo A. On the number of connected convex subgraphs of a connected acyclic digraph Discrete Applied Mathematics. 157: 1660-1662. DOI: 10.1016/j.dam.2008.07.010  0.071
2009 Gutin G. Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems Electronic Notes in Discrete Mathematics. 32: 75-82. DOI: 10.1016/j.endm.2009.02.011  0.07
2009 Gutin G, Jung Kim E. Properly coloured cycles and paths: Results and open problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5420: 200-208. DOI: 10.1007/978-3-642-02029-2_19  0.069
2012 Crowston R, Gutin G, Jones M. Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound Leibniz International Proceedings in Informatics, Lipics. 18: 400-411. DOI: 10.4230/LIPIcs.FSTTCS.2012.400  0.067
2005 Gutin G, Yeo A. Domination analysis of combinatorial optimization algorithms and problems Operations Research/ Computer Science Interfaces Series. 34: 145-171.  0.066
1998 Gutin G. A note on the cardinality of certain classes of unlabeled multipartite tournaments Discrete Mathematics. 186: 277-280.  0.065
2008 Gutin G, Karapetyan D, Krasnogor N. Memetic algorithm for the generalized asymmetric traveling salesman problem Studies in Computational Intelligence. 129: 199-210. DOI: 10.1007/978-3-540-78987-1_19  0.065
2012 Gutin G, Van Iersel L, Mnich M, Yeo A. Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables Journal of Computer and System Sciences. 78: 151-163. DOI: 10.1016/j.jcss.2011.01.004  0.063
2010 Gutin G, Van Iersel L, Mnich M, Yeo A. All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6346: 326-337. DOI: 10.1007/978-3-642-15775-2_28  0.063
2001 Glover F, Gutin G, Yeo A, Zverovich A. Construction heuristics for the asymmetric TSP European Journal of Operational Research. 129: 555-568. DOI: 10.1016/S0377-2217(99)00468-3  0.063
2011 Karapetyan D, Gutin G. Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem European Journal of Operational Research. 208: 221-232. DOI: 10.1016/j.ejor.2010.08.011  0.063
1998 Bang-Jensen J, Gutin G. Alternating cycles and trails in 2-edge-coloured complete multigraphs Discrete Mathematics. 188: 61-72.  0.062
2010 Gutin G, Kim EJ. The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops Discrete Applied Mathematics. 158: 319-330. DOI: 10.1016/j.dam.2009.07.013  0.062
1995 Blokh D, Gutin G. Maximizing traveling salesman problem for special matrices Discrete Applied Mathematics. 56: 83-86. DOI: 10.1016/0166-218X(94)00074-N  0.062
1997 Bang-Jensen J, Gutin G. Paths and cycles in extended and decomposable digraphs Discrete Mathematics. 164: 5-19.  0.061
2015 Karapetyan D, Gagarin A, Gutin G. Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9130: 138-149. DOI: 10.1007/978-3-319-19647-3_13  0.06
2012 Gutin G, Jones M. Note on large subsets of binary vectors with similar distances Siam Journal On Discrete Mathematics. 26: 1108-1111. DOI: 10.1137/120867962  0.06
2012 Gutin G, Kim EJ, Soleimanfallah A, Szeider S, Yeo A. Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming Algorithmica. 64: 112-125. DOI: 10.1007/s00453-011-9548-8  0.059
2012 Karapetyan D, Gutin G. Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem European Journal of Operational Research. 219: 234-251. DOI: 10.1016/j.ejor.2012.01.011  0.058
2013 Crowston R, Gutin G, Jones M, Muciaccia G. Maximum balanced subgraph problem parameterized above lower bound Theoretical Computer Science. 513: 53-64. DOI: 10.1016/j.tcs.2013.10.026  0.057
2008 Gutin G, Razgon I, Kim EJ. Minimum leaf out-branching problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5034: 235-246. DOI: 10.1007/978-3-540-68880-8_23  0.057
1998 Bang-Jensen J, Gutin G, Yeo A. A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs Journal of Graph Theory. 29: 111-132.  0.056
2007 Alon N, Fomin FV, Gutin G, Krivelevich M, Saurabh S. Better algorithms and bounds for directed maximum leaf problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4855: 316-327.  0.056
2010 Crowston R, Gutin G, Jones M. Note on max Lin-2 above average Information Processing Letters. 110: 451-454. DOI: 10.1016/j.ipl.2010.04.010  0.055
2010 Gutin G, Karapetyan D. A memetic algorithm for the generalized traveling salesman problem Natural Computing. 9: 47-60. DOI: 10.1007/s11047-009-9111-6  0.055
2009 Dankelmann P, Gutin G, Kim EJ. On complexity of Minimum Leaf Out-Branching problem Discrete Applied Mathematics. 157: 3000-3004. DOI: 10.1016/j.dam.2009.04.012  0.054
2006 Gutin G, Rafiey A. Multipartite tournaments with small number of cycles Australasian Journal of Combinatorics. 34: 17-21.  0.054
1995 Bang-Jensen J, Gutin G, Huang J. Weakly Hamiltonian-connected ordinary multipartite tournaments Discrete Mathematics. 138: 63-74. DOI: 10.1016/0012-365X(94)00188-O  0.054
2014 Cohen D, Crampton J, Gagarin A, Gutin G, Jones M. Iterative plan construction for the workflow satisfiability problem Journal of Artificial Intelligence Research. 51: 555-577. DOI: 10.1613/Jair.4435  0.053
2016 Gutin G, Wahlström M. Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis Information Processing Letters. 116: 223-226. DOI: 10.1016/j.ipl.2015.11.008  0.053
2015 Barbero F, Gutin G, Jones M, Sheng B. Parameterized and approximation algorithms for the load coloring problem Leibniz International Proceedings in Informatics, Lipics. 43: 43-54. DOI: 10.4230/LIPIcs.IPEC.2015.43  0.052
2014 Gutin G, Jones M. Parameterized algorithms for load coloring problem Information Processing Letters. 114: 446-449. DOI: 10.1016/j.ipl.2014.03.008  0.052
2012 Gutin G, Johnstone A, Reddington J, Scott E, Yeo A. An algorithm for finding input-output constrained convex sets in an acyclic digraph Journal of Discrete Algorithms. 13: 47-58. DOI: 10.1016/J.Jda.2012.02.002  0.052
2011 Fellows MR, Fomin FV, Gutin G. Special issue on parameterized complexity of discrete optimization Discrete Optimization. 8: 1. DOI: 10.1016/j.disopt.2011.02.001  0.051
2006 Feng J, Giesen HE, Guo Y, Gutin G, Jensen T, Rafiey A. Characterization of edge-colored complete graphs with properly colored Hamilton paths Journal of Graph Theory. 53: 333-346. DOI: 10.1002/jgt.20188  0.051
1997 Alon N, Gutin G. Properly colored Hamilton cycles in edge-colored complete graphs Random Structures and Algorithms. 11: 179-186.  0.051
2005 Gutin G, Kloks T, Lee CM, Yeo A. Kernels in planar digraphs Journal of Computer and System Sciences. 71: 174-184. DOI: 10.1016/j.jcss.2005.02.003  0.051
2007 Alon N, Fomin FV, Gutin G, Krivelevich M, Saurabh S. Parameterized algorithms for directed maximum leaf problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 352-362.  0.05
2013 Crampton J, Gutin G, Yeo A. On the parameterized complexity and kernelization of the workflow satisfiability problem Acm Transactions On Information and System Security. 16. DOI: 10.1145/2487222.2487226  0.05
2013 Gutin G, Muciaccia G, Yeo A. (Non)existence of polynomial kernels for the Test Cover problem Information Processing Letters. 113: 123-126. DOI: 10.1016/j.ipl.2012.12.008  0.05
2006 Gutin G, Rafiey A, Yeo A, Tso M. Level of repair analysis and minimum cost homomorphisms of graphs Discrete Applied Mathematics. 154: 881-889. DOI: 10.1016/j.dam.2005.06.012  0.05
2003 Gutin G, Yeo A. Assignment problem based algorithms are impractical for the generalized TSP Australasian Journal of Combinatorics. 27: 149-153.  0.05
1996 Gutin G, Yeo A. Ranking the vertices of a complete multipartite paired comparison digraph Discrete Applied Mathematics. 69: 75-82.  0.05
2014 Gutin G, Jones M, Sheng B, Wahlström M. Parameterized directed k-Chinese postman problem and k Arc-disjoint cycles problem on Euler Digraphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8747: 250-262. DOI: 10.1007/978-3-319-12340-0_21  0.049
2008 Gutin G. Note on edge-colored graphs and digraphs without properly colored cycles Australasian Journal of Combinatorics. 42: 137-140.  0.049
2010 Daligault J, Gutin G, Kim EJ, Yeo A. FPT algorithms and kernels for the Directed k-Leaf problem Journal of Computer and System Sciences. 76: 144-152. DOI: 10.1016/j.jcss.2009.06.005  0.049
2009 Gutin G, Razgon I, Kim EJ. Minimum leaf out-branching and related problems Theoretical Computer Science. 410: 4571-4579. DOI: 10.1016/j.tcs.2009.03.036  0.049
2011 Gutin G, Kim EJ, Lampis M, Mitsou V. Vertex Cover Problem Parameterized Above and Below Tight Bounds Theory of Computing Systems. 48: 402-410. DOI: 10.1007/s00224-010-9262-y  0.048
2002 Gutin G, Yeo A. Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number Discrete Applied Mathematics. 119: 107-116. DOI: 10.1016/S0166-218X(01)00267-0  0.048
2012 Crampton J, Gutin G, Yeo A. On the parameterized complexity of the workflow satisfiability problem Proceedings of the Acm Conference On Computer and Communications Security. 857-868. DOI: 10.1145/2382196.2382287  0.048
1998 Bang-Jensen J, Gutin G, Yeo A. Properly coloured Hamiltonian paths in edge-coloured complete graphs Discrete Applied Mathematics. 82: 247-250.  0.047
1998 Gutin G, Yeo A. Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour Computers and Operations Research. 26: 321-327. DOI: 10.1016/S0305-0548(98)00065-3  0.046
2008 Gutin G, Yeo A. Some parameterized problems on digraphs Computer Journal. 51: 363-371. DOI: 10.1093/comjnl/bxm039  0.046
2010 Cohen N, Fomin FV, Gutin G, Kim EJ, Saurabh S, Yeo A. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem Journal of Computer and System Sciences. 76: 650-662. DOI: 10.1016/j.jcss.2010.01.001  0.046
2004 Gutin G, Koh KM, Tay EG, Yeo A. On the Number of Quasi-Kernels in Digraphs Journal of Graph Theory. 46: 48-56. DOI: 10.1002/jgt.10169  0.045
2001 Gutin G, Yeo A. Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs Graphs and Combinatorics. 17: 473-477.  0.045
2000 Gutin G, Kostochka AV, Toft B. On the Hajós number of graphs Discrete Mathematics. 213: 153-161.  0.045
2008 Gutin G, Goldengorin B, Huang J. Worst case analysis of Max-Regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems Journal of Heuristics. 14: 169-181. DOI: 10.1007/s10732-007-9033-3  0.045
2012 Gutin G, Yeo A. Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width Discrete Applied Mathematics. 160: 2323-2328. DOI: 10.1016/j.dam.2012.04.020  0.044
2015 Crampton J, Gutin G, Karapetyan D. Valued workflow satisfiability problem Proceedings of Acm Symposium On Access Control Models and Technologies, Sacmat. 2015: 3-13. DOI: 10.1145/2752952.2752961  0.043
2006 Gutin G, Punnen A. The traveling salesman problem Discrete Optimization. 3: 1. DOI: 10.1016/J.Disopt.2005.12.001  0.041
2009 Gutin G, Karapetyan D. A memetic algorithm for the multidimensional assignment problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5752: 125-129. DOI: 10.1007/978-3-642-03751-1_12  0.041
2002 Gutin G, Punnen A. Preface Discrete Applied Mathematics. 119: 1-2. DOI: 10.1016/S0166-218X(01)00262-1  0.041
1998 Gutin G, Zverovich VE. Upper domination and upper irredundance perfect graphs Discrete Mathematics. 190: 95-105.  0.041
2014 Gutin G, Jones M, Sheng B. Parameterized complexity of the k-arc Chinese postman problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 530-541. DOI: 10.1007/978-3-662-44777-2-44  0.04
2009 Balister P, Gerke S, Gutin G, Johnstone A, Reddington J, Scott E, Soleimanfallah A, Yeo A. Algorithms for generating convex sets in acyclic digraphs Journal of Discrete Algorithms. 7: 509-518. DOI: 10.1016/J.Jda.2008.07.008  0.04
2012 Crowston R, Gutin G, Jones M, Yeo A. A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications Algorithmica. 64: 56-68. DOI: 10.1007/s00453-011-9550-1  0.04
1996 Blokh D, Gutin G. An approximate algorithm for combinatorial optimization problems with two parameters Australasian Journal of Combinatorics. 14: 157-164.  0.04
1994 Gutin G. Minimizing and maximizing the diameter in orientations of graphs Graphs and Combinatorics. 10: 225-230. DOI: 10.1007/BF02986669  0.039
2008 Gutin G, Hell P, Rafiey A, Yeo A. A dichotomy for minimum cost graph homomorphisms European Journal of Combinatorics. 29: 900-911. DOI: 10.1016/J.Ejc.2007.11.012  0.039
2012 Gutin G, Yeo A. Constraint satisfaction problems parameterized above or below tight bounds: A survey Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7370: 257-286. DOI: 10.1007/978-3-642-30891-8_14  0.038
2013 Gutin G, Muciaccia G, Yeo A. Parameterized complexity of k-Chinese postman problem Theoretical Computer Science. 513: 124-128. DOI: 10.1016/j.tcs.2013.10.012  0.038
2011 Karapetyan D, Gutin G. Local search heuristics for the multidimensional assignment problem Journal of Heuristics. 17: 201-249. DOI: 10.1007/s10732-010-9133-3  0.037
2011 Gutin G, Mansour T, Severini S. A characterization of horizontal visibility graphs and combinatorics on words Physica a: Statistical Mechanics and Its Applications. 390: 2421-2428. DOI: 10.1016/j.physa.2011.02.031  0.037
2003 Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A. Transformations of generalized ATSP into ATSP Operations Research Letters. 31: 357-365. DOI: 10.1016/S0167-6377(03)00031-2  0.037
2010 Crowston R, Gutin G, Jones M, Kim EJ, Ruzsa IZ. Systems of linear equations over double-struck F2 and problems parameterized above average Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6139: 164-175. DOI: 10.1007/978-3-642-13731-0_17  0.036
2004 Alon N, Gutin G, Krivelevich M. Algorithms with large domination ratio Journal of Algorithms. 50: 118-131. DOI: 10.1016/j.jalgor.2003.09.003  0.035
1998 Gutin G. Exponential neighbourhood local search for the traveling salesman problem Computers and Operations Research. 26: 313-320. DOI: 10.1016/S0305-0548(98)00064-1  0.035
2012 Crowston R, Gutin G, Jones M, Saurabh S, Yeo A. Parameterized study of the test cover problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7464: 283-295. DOI: 10.1007/978-3-642-32589-2_27  0.034
2015 Gutin GZ, Szeider S. Guest Editorial: Special Issue on Parameterized and Exact Computation Algorithmica. 71: 539-540. DOI: 10.1007/s00453-014-9960-y  0.034
2013 Crampton J, Crowston R, Gutin G, Jones M, Ramanujan MS. Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7924: 198-209. DOI: 10.1007/978-3-642-38756-2_21  0.034
2003 Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A. Process planning for rotational parts using the generalized travelling salesman problem International Journal of Production Research. 41: 2581-2596. DOI: 10.1080/0020754031000087337  0.034
2009 Balister P, Gerke S, Gutin G. Convex sets in acyclic digraphs Order. 26: 95-100. DOI: 10.1007/s11083-009-9109-9  0.034
2009 Gutin G, Karapetyan D. A selection of useful theoretical tools for the design and analysis of optimization heuristics Memetic Computing. 1: 25-34. DOI: 10.1007/s12293-008-0001-8  0.034
2007 Gutin G, Rafiey A, Szeider S, Yeo A. The linear arrangement problem parameterized above guaranteed value Theory of Computing Systems. 41: 521-538. DOI: 10.1007/s00224-007-1330-6  0.033
2009 Reddington J, Gutin G, Johnstone A, Scott E, Yeo A. Better than optimal: Fast identification of custom instruction candidates Proceedings - 12th Ieee International Conference On Computational Science and Engineering, Cse 2009. 2: 17-24. DOI: 10.1109/CSE.2009.167  0.032
2010 Gupta A, Gutin G, Karimi M, Kim EJ, Rafiey A. Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs Australasian Journal of Combinatorics. 46: 227-232.  0.032
2000 Gutin G, Yeo A. Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian Journal of Combinatorial Theory. Series B. 78: 232-242. DOI: 10.1006/jctb.1999.1942  0.031
1997 Bang-Jensen J, Gutin G, Yeo A. Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments Combinatorics Probability and Computing. 6: 255-261.  0.031
2015 Barbero F, Gutin G, Jones M, Sheng B, Yeo A. Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths Information Processing Letters. DOI: 10.1016/j.ipl.2016.01.007  0.031
2000 Gutin G. Connected (g, f)-factors and supereulerian digraphs Ars Combinatoria. 54: 311-317.  0.031
1997 Bang-Jensen J, Gutin G. Vertex heaviest paths and cycles in quasi-transitive digraphs Discrete Mathematics. 163: 217-223.  0.03
1993 Gutin G. On Cycles in Multipartite Tournaments Journal of Combinatorial Theory, Series B. 58: 319-321. DOI: 10.1006/jctb.1993.1047  0.03
1997 Bang-Jensen J, Guo Y, Gutin G, Volkmann L. A classification of locally semicomplete digraphs Discrete Mathematics. 167: 101-114.  0.03
2010 Gutin G, Yeo A. Note on maximal bisection above tight lower bound Information Processing Letters. 110: 966-969. DOI: 10.1016/j.ipl.2010.08.001  0.03
2011 Gutin G, Kim EJ, Szeider S, Yeo A. A probabilistic approach to problems parameterized above or below tight bounds Journal of Computer and System Sciences. 77: 422-429. DOI: 10.1016/j.jcss.2010.06.001  0.029
2001 Gutin G, Yeo A. Remarks on hamiltonian digraphs Australasian Journal of Combinatorics. 23: 115-118.  0.029
2006 Gutin G, Steiner G, Xue Z, Voloshin V, Zak EJ. Research problems Discrete Applied Mathematics. 154: 604-607. DOI: 10.1016/j.dam.2005.09.001  0.028
1997 Gutin G, Yeo A. Hamiltonian Paths and Cycles in Hypertournaments Journal of Graph Theory. 25: 277-286.  0.028
2006 Gutin G, Rafiey A, Severini S, Yeo A. Hamilton cycles in digraphs of unitary matrices Discrete Mathematics. 306: 3315-3320. DOI: 10.1016/j.disc.2006.06.010  0.028
1997 Bang-Jensen J, Gutin G. Alternating cycles and paths in edge-coloured multigraphs: A survey Discrete Mathematics. 165: 39-60.  0.028
2004 Bang-Jensen J, Gutin G, Yeo A. When the greedy algorithm fails Discrete Optimization. 1: 121-127. DOI: 10.1016/j.disopt.2004.03.007  0.027
2002 Gutin G, Koh KM, Tay EG, Yeo A. Almost minimum diameter orientations of semicomplete multipartite and extended digraphs Graphs and Combinatorics. 18: 499-506. DOI: 10.1007/s003730200036  0.027
2009 Gutin G, Rafiey A, Yeo A. Minimum cost homomorphism dichotomy for oriented cycles Graphs and Combinatorics. 25: 521-531. DOI: 10.1007/s00373-009-0853-9  0.027
2015 Gutin G, Jones M, Wahlström M. Structural parameterizations of the mixed Chinese postman problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9294: 668-679. DOI: 10.1007/978-3-662-48350-3_56  0.027
2000 Gülpinar N, Gutin G, Mitra G, Maros I. Detecting embedded networks in LP using GUB structures and independent set algorithms Computational Optimization and Applications. 15: 235-247. DOI: 10.1023/A:1008791601215  0.026
2005 Gutin G, Glover F. Further extension of the TSP assign neighborhood Journal of Heuristics. 11: 501-505. DOI: 10.1007/s10732-005-3487-y  0.026
2008 Gutin G, Szeider S, Yeo A. Fixed-parameter complexity of minimum profile problems Algorithmica (New York). 52: 133-152. DOI: 10.1007/s00453-007-9144-0  0.026
2011 Karapetyan D, Gutin G. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem. Evolutionary Computation. 19: 345-71. PMID 20868263 DOI: 10.1162/EVCO_a_00026  0.025
2013 Gutin G, Jones M, Scheder D, Yeo A. A new bound for 3-satisfiable MaxSat and its algorithmic application Information and Computation. 231: 117-124. DOI: 10.1016/j.ic.2013.08.008  0.023
2006 Gutin G, Rafiey A, Yeo A. Minimum cost and list homomorphisms to semicomplete digraphs Discrete Applied Mathematics. 154: 890-897. DOI: 10.1016/j.dam.2005.11.006  0.023
2008 Gutin G, Rafiey A, Yeo A. Minimum cost homomorphisms to semicomplete bipartite digraphs Siam Journal On Discrete Mathematics. 22: 1624-1639. DOI: 10.1137/060668316  0.021
2000 Gutin G, Yeo A. Kings in semicomplete multipartite digraphs Journal of Graph Theory. 33: 177-183.  0.021
2008 Gutin G, Rafiey A, Yeo A. Minimum cost homomorphisms to semicomplete multipartite digraphs Discrete Applied Mathematics. 156: 2429-2435. DOI: 10.1016/j.dam.2007.09.023  0.02
2010 Gutin G, Kim EJ, Mnich M, Yeo A. Betweenness parameterized above tight lower bound Journal of Computer and System Sciences. 76: 872-878. DOI: 10.1016/j.jcss.2010.05.001  0.02
2014 Cohen D, Crampton J, Gagarin A, Gutin G, Jones M. Engineering algorithms for workflow satisfiability problem with user-independent constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8497: 48-59. DOI: 10.1007/978-3-319-08016-1_5  0.02
1996 Bang-Jensen J, Gutin G, Huang J. A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian Discrete Mathematics. 161: 1-12.  0.02
1996 Bang-Jensen J, Gutin G, Li H. Sufficient Conditions for a Digraph to be Hamiltonian Journal of Graph Theory. 22: 181-187.  0.018
2004 Gutin G, Rafiey A. When n-cycles in n-partite tournaments are longest cycles Discrete Mathematics. 289: 163-168. DOI: 10.1016/j.disc.2004.10.007  0.017
2014 Crowston R, Gutin G, Jones M, Raman V, Saurabh S, Yeo A. Fixed-parameter tractability of satisfying beyond the number of variables Algorithmica. 68: 739-757. DOI: 10.1007/s00453-012-9697-4  0.017
2013 Crowston R, Gutin G, Jones M, Raman V, Saurabh S. Parameterized complexity of MaxSat above Average Theoretical Computer Science. 511: 77-84. DOI: 10.1016/j.tcs.2013.01.005  0.016
2008 Alon N, Fomin FV, Gutin G, Krivelevich M, Saurabh S. Spanning directed trees with many leaves Siam Journal On Discrete Mathematics. 23: 466-476. DOI: 10.1137/070710494  0.016
2006 Gutin G, Rafiey A, Yeo A. On n-partite tournaments with unique n-cycle Graphs and Combinatorics. 22: 241-249. DOI: 10.1007/s00373-006-0641-8  0.016
2011 Alon N, Gutin G, Kim EJ, Szeider S, Yeo A. Solving MAX-r-SAT above a Tight Lower Bound Algorithmica (New York). 61: 638-655. DOI: 10.1007/s00453-010-9428-7  0.015
2015 Crampton J, Farley N, Gutin G, Jones M, Poettering B. Cryptographic enforcement of information flow policies without public information Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9092: 389-408. DOI: 10.1007/978-3-319-28166-7_19  0.015
2005 Gutin G, Zverovitch A. Evaluation of the contract-or-patch heuristic for the asymmetric TSP Infor. 43: 23-31.  0.014
2013 Gutin G, Szeider S. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8246: v-vi. DOI: 10.1007/978-3-319-03898-8  0.013
1996 Bang-Jensen J, Gutin G, Yeo A. On k-strong and k-cyclic digraphs Discrete Mathematics. 162: 1-11.  0.013
2002 Gutin G, Yeo A. Orientations of digraphs almost preserving diameter Discrete Applied Mathematics. 121: 129-138. DOI: 10.1016/S0166-218X(01)00298-0  0.012
2013 Crowston R, Gutin G, Jones M, Yeo A. Parameterized Complexity of Satisfying Almost All Linear Equations over F2 Theory of Computing Systems. 52: 719-728. DOI: 10.1007/s00224-012-9415-2  0.011
2016 Gutin G, Landau D. Leuprolide Injection Causing Pituitary Apoplexy: A Case Report Journal of Headache & Pain Management. 1. DOI: 10.4172/2472-1913.100012  0.01
2016 Crowston R, Gutin G, Jones M, Muciaccia G, Yeo A. Parameterizations of Test Cover with Bounded Test Sizes Algorithmica. 74: 367-384. DOI: 10.1007/s00453-014-9948-7  0.01
2015 Gutin G, Kratsch S, Wahlström M. Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem Algorithmica. DOI: 10.1007/s00453-015-9986-9  0.01
2015 Crampton J, Farley N, Gutin G, Jones M. Optimal constructions for chain-based cryptographic enforcement of information flow policies Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9149: 330-345. DOI: 10.1007/978-3-319-20810-7_23  0.01
2014 Crowston R, Fellows M, Gutin G, Jones M, Kim EJ, Rosamond F, Ruzsa IZ, Thomassé S, Yeo A. Satisfying more than half of a system of linear equations over GF(2): A multivariate approach Journal of Computer and System Sciences. 80: 687-696. DOI: 10.1016/j.jcss.2013.10.002  0.01
2011 Crowston R, Fellows M, Gutin G, Jones M, Rosamond F, Thomassé S, Yeo A. Simultaneously satisfying linear equations over F2: MaxLin2 and Max-r-Lin2 parameterized above average Leibniz International Proceedings in Informatics, Lipics. 13: 229-240. DOI: 10.4230/LIPIcs.FSTTCS.2011.229  0.01
2009 Gutin G, Karapetyan D, Razgon I. Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5917: 222-233. DOI: 10.1007/978-3-642-11269-0_18  0.01
2005 Gutin G, Jensen T, Yeo A. Batched bin packing Discrete Optimization. 2: 71-82. DOI: 10.1016/j.disopt.2004.11.001  0.01
2005 Gutin G, Jones N, Rafiey A, Severini S, Yeo A. Mediated digraphs and quantum nonlocality Discrete Applied Mathematics. 150: 41-50. DOI: 10.1016/j.dam.2005.05.002  0.01
2004 Gülpinar N, Gutin G, Mitra G, Zverovitch A. Extracting pure network submatrices in linear programs using signed graphs Discrete Applied Mathematics. 137: 359-372. DOI: 10.1016/S0166-218X(03)00361-5  0.01
2002 Gutin G, Yeo A. Anti-matroids Operations Research Letters. 30: 97-99. DOI: 10.1016/S0167-6377(02)00117-7  0.01
1998 Bang-Jensen J, Gutin G. Generalizations of Tournaments: A Survey Journal of Graph Theory. 28: 171-202.  0.01
1986 Gutin GM. The radii of n-partite tournaments Mathematical Notes of the Academy of Sciences of the Ussr. 40: 743-744. DOI: 10.1007/BF01142481  0.01
Hide low-probability matches.