- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j117 |      | Michael A. Henning, Anders Yeo: Total domination and matching numbers in graphs with all vertices in triangles. Discrete Mathematics 313(2): 174-181 (2013) |
| j116 | | Michael A. Henning, Anders Yeo: Hypergraphs with large transversal number. Discrete Mathematics 313(8): 959-966 (2013) |
| j115 | | Michael A. Henning, Anders Yeo: Transversals and matchings in 3-uniform hypergraphs. Eur. J. Comb. 34(2): 217-228 (2013) |
| j114 | | Gregory Gutin, Gabriele Muciaccia, Anders Yeo: (Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. 113(4): 123-126 (2013) |
| j113 | | Michael A. Henning, Anders Yeo: Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. Journal of Graph Theory 72(2): 220-245 (2013) |
| j112 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. 52(4): 719-728 (2013) |
| j111 | | Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo: Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. Theor. Comput. Sci. 475: 13-20 (2013) |
| 2012 | ||
| j110 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica 64(1): 56-68 (2012) |
| j109 | | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) |
| j108 | | Gregory Gutin, Anders Yeo: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discrete Applied Mathematics 160(15): 2323-2328 (2012) |
| j107 | | Teresa W. Haynes, Michael A. Henning, Anders Yeo: On a conjecture of Murty and Simon on diameter two critical graphs II. Discrete Mathematics 312(2): 315-323 (2012) |
| j106 | | Michael A. Henning, Anders Yeo: Girth and Total Domination in Graphs. Graphs and Combinatorics 28(2): 199-214 (2012) |
| j105 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112(6): 249-251 (2012) |
| j104 | | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. 78(1): 151-163 (2012) |
| j103 | | Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo: An algorithm for finding input-output constrained convex sets in an acyclic digraph. J. Discrete Algorithms 13: 47-58 (2012) |
| j102 | | Michael A. Henning, Anders Yeo: Vertex Disjoint Cycles of Different Length in Digraphs. SIAM J. Discrete Math. 26(2): 687-694 (2012) |
| j101 | | Jørgen Bang-Jensen, Anders Yeo: Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. 438: 48-54 (2012) |
| c23 | | Gregory Gutin, Anders Yeo: Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. The Multivariate Algorithmic Revolution and Beyond 2012: 257-286 |
| c22 | | Jason Crampton, Gregory Gutin, Anders Yeo: On the parameterized complexity of the workflow satisfiability problem. ACM Conference on Computer and Communications Security 2012: 857-868 |
| c21 | | Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh, Anders Yeo: Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295 |
| c20 | | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo: Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368 |
| i29 | | Gregory Gutin, Gabriele Muciaccia, Anders Yeo: (Non-)existence of Polynomial Kernels for the Test Cover Problem. CoRR abs/1204.4368 (2012) |
| i28 | | Jason Crampton, Gregory Gutin, Anders Yeo: On the Parameterized Complexity of the Workflow Satisfiability Problem. CoRR abs/1205.0852 (2012) |
| i27 | | Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo: Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012) |
| i26 | | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo: Fixed-parameter tractability of satisfying beyond the number of variables. CoRR abs/1212.0106 (2012) |
| i25 | | Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh, Anders Yeo: Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012) |
| 2011 | ||
| j100 | | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) |
| j99 | | Michael A. Henning, Ingo Schiermeyer, Anders Yeo: A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electr. J. Comb. 18(1) (2011) |
| j98 | | Teresa W. Haynes, Michael A. Henning, Anders Yeo: A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. Discrete Optimization 8(3): 495-501 (2011) |
| j97 | | Arezou Soleimanfallah, Anders Yeo: A kernel of order 2k-c for Vertex Cover. Discrete Mathematics 311(10-11): 892-895 (2011) |
| j96 | | Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo: On the existence of k-partite or Kp-free total domination edge-critical graphs. Discrete Mathematics 311(13): 1142-1149 (2011) |
| j95 | | Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo: On a conjecture of Murty and Simon on diameter 2-critical graphs. Discrete Mathematics 311(17): 1918-1924 (2011) |
| j94 | | Michael A. Henning, Anders Yeo: Perfect Matchings in Total Domination Critical Graphs. Graphs and Combinatorics 27(5): 685-701 (2011) |
| j93 | | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) |
| j92 | | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011) |
| j91 | | Gregory Gutin, Mark Jones, Anders Yeo: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. 412(41): 5744-5751 (2011) |
| c19 | | Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147 |
| c18 | | Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240 |
| i24 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory. CoRR abs/1104.1135 (2011) |
| i23 | | Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. CoRR abs/1104.2818 (2011) |
| i22 | | Gregory Gutin, Anders Yeo: Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width. CoRR abs/1106.1049 (2011) |
| i21 | | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. CoRR abs/1106.3527 (2011) |
| i20 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. CoRR abs/1106.4454 (2011) |
| i19 | | Gregory Gutin, Anders Yeo: Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey. CoRR abs/1108.4803 (2011) |
| i18 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$. CoRR abs/1110.5915 (2011) |
| 2010 | ||
| j90 | | Gregory Gutin, Anders Yeo: Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21): 966-969 (2010) |
| j89 | | Jean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo: FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. 76(2): 144-152 (2010) |
| j88 | | Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010) |
| j87 | | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) |
| j86 | | Michael A. Henning, Anders Yeo: Strong Transversals in Hypergraphs and Double Total Domination in Graphs. SIAM J. Discrete Math. 24(4): 1336-1355 (2010) |
| c17 | | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) 2010: 326-337 |
| c16 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC 2010: 84-94 |
| c15 | | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 |
| c14 | | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 |
| i17 | | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation. CoRR abs/1004.0526 (2010) |
| i16 | | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels. CoRR abs/1004.1956 (2010) |
| i15 | | Gregory Gutin, Anders Yeo: Note on Maximal Bisection above Tight Lower Bound. CoRR abs/1005.2848 (2010) |
| i14 | | Gregory Gutin, Mark Jones, Anders Yeo: Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems. CoRR abs/1010.5881 (2010) |
| 2009 | ||
| j85 | | Katalin M. Hangos, Zsolt Tuza, Anders Yeo: Some complexity problems on single input double output controllers. Discrete Applied Mathematics 157(5): 1146-1158 (2009) |
| j84 | | Gregory Gutin, Anders Yeo: On the number of connected convex subgraphs of a connected acyclic digraph. Discrete Applied Mathematics 157(7): 1660-1662 (2009) |
| j83 | | Allan Frendrup, Preben D. Vestergaard, Anders Yeo: Total Domination in Partitioned Graphs. Graphs and Combinatorics 25(2): 181-196 (2009) |
| j82 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs and Combinatorics 25(4): 521-531 (2009) |
| j81 | | Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7(4): 509-518 (2009) |
| j80 | | Michael A. Henning, Anders Yeo: Total domination in 2-connected graphs and in graphs with no induced 6-cycles. Journal of Graph Theory 60(1): 55-79 (2009) |
| c13 | | Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46 |
| c12 | | Joseph Reddington, Gregory Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo: Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) 2009: 17-24 |
| c11 | | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646 |
| c10 | | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 |
| c9 | | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo: A Polynomial Kernel for Multicut in Trees. STACS 2009: 183-194 |
| i13 | | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo: A Polynomial Kernel For Multicut In Trees. CoRR abs/0902.1047 (2009) |
| i12 | | Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem. CoRR abs/0903.0938 (2009) |
| i11 | | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009) |
| i10 | | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) |
| i9 | | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009) |
| 2008 | ||
| j79 | | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) |
| j78 | | Gregory Gutin, Anders Yeo: Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008) |
| j77 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost homomorphisms to semicomplete multipartite digraphs. Discrete Applied Mathematics 156(12): 2429-2435 (2008) |
| j76 | | Jørgen Bang-Jensen, Anders Yeo: The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Mathematics 156(15): 2924-2929 (2008) |
| j75 | | Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo: On matching and total domination in graphs. Discrete Mathematics 308(11): 2313-2318 (2008) |
| j74 | | Frédéric Havet, Stéphan Thomassé, Anders Yeo: Hoàng-Reed conjecture holds for tournaments. Discrete Mathematics 308(15): 3412-3415 (2008) |
| j73 | | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) |
| j72 | | Michael A. Henning, Anders Yeo: Total Domination in Graphs with Given Girth. Graphs and Combinatorics 24(4): 333-348 (2008) |
| j71 | | Michael A. Henning, Anders Yeo: Hypergraphs with large transversal number and with edge sizes at least 3. Journal of Graph Theory 59(4): 326-348 (2008) |
| j70 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discrete Math. 22(4): 1624-1639 (2008) |
| c8 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234 |
| c7 | | Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo: An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. WG 2008: 206-217 |
| i8 | | Jean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo: FPT Algorithms and Kernels for the Directed $k$-Leaf Problem. CoRR abs/0810.4946 (2008) |
| 2007 | ||
| j69 | | Gregory Gutin, Anders Yeo: The Greedy Algorithm for the Symmetric TSP. Algorithmic Operations Research 2(1) (2007) |
| j68 | | Stéphan Thomassé, Anders Yeo: Total domination of graphs and small transversals of hypergraphs. Combinatorica 27(4): 473-487 (2007) |
| j67 | | Michael A. Henning, Anders Yeo: A New Upper Bound on the Total Domination Number of a Graph. Electr. J. Comb. 14(1) (2007) |
| j66 | | Pierre Charbit, Stéphan Thomassé, Anders Yeo: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Combinatorics, Probability & Computing 16(1): 1-4 (2007) |
| j65 | | Michael A. Henning, Anders Yeo: Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. Graphs and Combinatorics 23(6): 647-657 (2007) |
| j64 | | Anders Yeo: Paths and cycles containing given arcs, in close to regular multipartite tournaments. J. Comb. Theory, Ser. B 97(6): 949-963 (2007) |
| j63 | | Anders Yeo: Relationships between total domination, order, size, and maximum degree of graphs. Journal of Graph Theory 55(4): 325-337 (2007) |
| j62 | | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) |
| i7 | | Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs. CoRR abs/0712.2661 (2007) |
| 2006 | ||
| j61 | | Gregory Gutin, Angela Koller, Anders Yeo: Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research 1(1) (2006) |
| j60 | | Gregory Gutin, Tommy R. Jensen, Anders Yeo: On-line bin Packing with Two Item Sizes. Algorithmic Operations Research 1(2) (2006) |
| j59 | | Michael A. Henning, Anders Yeo: Total Domination and Matching Numbers in Claw-Free Graphs. Electr. J. Comb. 13(1) (2006) |
| j58 | | Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154(6): 881-889 (2006) |
| j57 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154(6): 890-897 (2006) |
| j56 | | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Domination analysis for minimum multiprocessor scheduling. Discrete Applied Mathematics 154(18): 2613-2619 (2006) |
| j55 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discrete Optimization 3(1): 86-94 (2006) |
| j54 | | Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo: Longest path partitions in generalizations of tournaments. Discrete Mathematics 306(16): 1830-1839 (2006) |
| j53 | | Gregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo: Hamilton cycles in digraphs of unitary matrices. Discrete Mathematics 306(24): 3315-3320 (2006) |
| j52 | | Gregory Gutin, Arash Rafiey, Anders Yeo: On n-partite Tournaments with Unique n-cycle. Graphs and Combinatorics 22(2): 241-249 (2006) |
| c6 | | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 |
| c5 | | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 |
| i6 | | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006) |
| i5 | | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006) |
| i4 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. CoRR abs/cs/0608101 (2006) |
| 2005 | ||
| j51 | | Gregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo: Mediated digraphs and quantum nonlocality. Discrete Applied Mathematics 150(1-3): 41-50 (2005) |
| j50 | | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Batched bin packing. Discrete Optimization 2(1): 71-82 (2005) |
| j49 | | David Blokh, Gregory Gutin, Anders Yeo: A problem of finding an acceptable variant in generalized project networks. JAMDS 9(2): 75-81 (2005) |
| j48 | | Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) |
| j47 | | Anders Yeo: The number of pancyclic arcs in a k-strong tournament. Journal of Graph Theory 50(3): 212-219 (2005) |
| c4 | | Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso: Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM 2005: 427-439 |
| c3 |  | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 |
| c2 | | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103 |
| i3 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost and List Homomorphisms to Semicomplete Digraphs. CoRR abs/cs/0507017 (2005) |
| i2 | | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. CoRR abs/cs/0509091 (2005) |
| i1 | | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005) |
| 2004 | ||
| j46 | | Jørgen Bang-Jensen, Anders Yeo: Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Combinatorica 24(3): 331-349 (2004) |
| j45 | | Jørgen Bang-Jensen, Anders Yeo: Making a tournament k-arc-strong by reversing or deorienting arcs. Discrete Applied Mathematics 136(2-3): 161-171 (2004) |
| j44 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004) |
| j43 | | Lutz Volkmann, Anders Yeo: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Discrete Mathematics 281(1-3): 267-276 (2004) |
| j42 | | Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo: On the number of quasi-kernels in digraphs. Journal of Graph Theory 46(1): 48-56 (2004) |
| j41 | | Jørgen Bang-Jensen, Jing Huang, Anders Yeo: Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. Journal of Graph Theory 46(4): 265-284 (2004) |
| 2003 | ||
| j40 | | Gregory Gutin, Alek Vainshtein, Anders Yeo: Domination analysis of combinatorial optimization problems. Discrete Applied Mathematics 129(2-3): 513-520 (2003) |
| j39 | | Gregory Gutin, Anders Yeo: Upper bounds on ATSP neighborhood size. Discrete Applied Mathematics 129(2-3): 533-538 (2003) |
| j38 | | Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo: Small degree out-branchings. Journal of Graph Theory 42(4): 297-307 (2003) |
| j37 | | Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo: Packing paths in digraphs. Journal of Graph Theory 44(2): 81-94 (2003) |
| j36 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. Journal of Graph Theory 44(3): 193-207 (2003) |
| j35 | | David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich: Transformations of generalized ATSP into ATSP. Oper. Res. Lett. 31(3): 357-365 (2003) |
| j34 | | Jørgen Bang-Jensen, Jing Huang, Anders Yeo: Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. SIAM J. Discrete Math. 16(2): 335-343 (2003) |
| 2002 | ||
| j33 | | Gregory Gutin, Anders Yeo, Alexey Zverovich: Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 117(1-3): 81-86 (2002) |
| j32 | | Gregory Gutin, Anders Yeo: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discrete Applied Mathematics 119(1-2): 107-116 (2002) |
| j31 | | Gregory Gutin, Anders Yeo: Orientations of digraphs almost preserving diameter. Discrete Applied Mathematics 121(1-3): 129-138 (2002) |
| j30 | | Jing Huang, Gary MacGillivray, Anders Yeo: Pushing vertices in digraphs without long induced cycles. Discrete Applied Mathematics 121(1-3): 181-192 (2002) |
| j29 | | Meike Tewes, Lutz Volkmann, Anders Yeo: Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. Discrete Mathematics 242(1-3): 201-228 (2002) |
| j28 | | Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo: Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs and Combinatorics 18(3): 499-506 (2002) |
| j27 | | |
| 2001 | ||
| j26 | | Jørgen Bang-Jensen, Anders Yeo: Making a tournament k-arc-strong by reversing arcs. Electronic Notes in Discrete Mathematics 8: 2-5 (2001) |
| j25 | | Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129(3): 555-568 (2001) |
| j24 | | Gregory Gutin, Anders Yeo: 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(3): 473-477 (2001) |
| j23 | | Jørgen Bang-Jensen, Anders Yeo: The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. J. Algorithms 41(1): 1-19 (2001) |
| j22 | | Gregory Gutin, Anders Yeo: TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001) |
| 2000 | ||
| j21 | | Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. Discrete Mathematics 212(1-2): 91-100 (2000) |
| j20 | | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo: Complementary cycles containing prescribed vertices in tournaments. Discrete Mathematics 214(1-3): 77-87 (2000) |
| j19 | | Gregory Gutin, Meike Tewes, Anders Yeo: Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discrete Mathematics 222(1-3): 269-274 (2000) |
| j18 | | Gregory Gutin, Anders Yeo: Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. J. Comb. Theory, Ser. B 78(2): 232-242 (2000) |
| j17 | | Gregory Gutin, Anders Yeo: Kings in semicomplete multipartite digraphs. Journal of Graph Theory 33(3): 177-183 (2000) |
| j16 | | Jørgen Bang-Jensen, Jing Huang, Anders Yeo: Convex-Round and Concave-Round Graphs. SIAM J. Discrete Math. 13(2): 179-193 (2000) |
| 1999 | ||
| j15 | | Gregory Gutin, Anders Yeo: Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Computers & OR 26(4): 321-327 (1999) |
| j14 | | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo: A New Sufficient Condition for a Digraph to Be Hamiltonian. Discrete Applied Mathematics 95(1-3): 61-72 (1999) |
| j13 | | Anders Yeo: How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? Graphs and Combinatorics 15(4): 481-493 (1999) |
| j12 | | Anders Yeo: A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. J. Algorithms 33(1): 124-139 (1999) |
| j11 | | Anders Yeo: Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments. Journal of Graph Theory 32(2): 123-136 (1999) |
| j10 | | Anders Yeo: Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5. Journal of Graph Theory 32(2): 137-152 (1999) |
| c1 | | Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction Heuristics and Domination Analysis for the Asymmetric TSP. Algorithm Engineering 1999: 85-94 |
| 1998 | ||
| j9 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discrete Applied Mathematics 82(1-3): 247-250 (1998) |
| j8 | | Gregory Gutin, Benny Sudakov, Anders Yeo: Note on alternating directed cycles. Discrete Mathematics 191(1-3): 101-107 (1998) |
| j7 | | Jing Huang, Anders Yeo: Maximal and Minimal Vertex-Critical Graphs of Diameter Two. J. Comb. Theory, Ser. B 74(2): 311-325 (1998) |
| j6 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. Journal of Graph Theory 29(2): 111-132 (1998) |
| 1997 | ||
| j5 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Combinatorics, Probability & Computing 6(3): 255-261 (1997) |
| j4 | | Anders Yeo: A Note on Alternating Cycles in Edge-Coloured Graphs. J. Comb. Theory, Ser. B 69(2): 222-225 (1997) |
| j3 | | Anders Yeo: One-diregular subgraphs in semicomplete multipartite digraphs. Journal of Graph Theory 24(2): 175-185 (1997) |
| 1996 | ||
| j2 | | Gregory Gutin, Anders Yeo: Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discrete Applied Mathematics 69(1-2): 75-82 (1996) |
| j1 | | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996) |
Data released under the ODC-BY 1.0 license — See also our legal information page