default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Yeo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j195]Michael A. Henning
, Anders Yeo:
Transversal coalitions in hypergraphs. Discret. Math. 348(2): 114267 (2025)- 2024
- [j194]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346: 215-227 (2024) - [j193]Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou:
Note on disjoint cycles in multipartite tournaments. Discret. Math. 347(10): 114126 (2024) - [j192]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Finding all stable matchings with assignment constraints. Games Econ. Behav. 148: 244-263 (2024) - [j191]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou:
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105(3): 413-426 (2024) - [j190]Michael A. Henning, Anders Yeo:
Transversals in regular uniform hypergraphs. J. Graph Theory 105(3): 468-485 (2024) - [j189]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. 38(3): 2370-2391 (2024) - [i60]Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR abs/2401.10074 (2024) - [i59]Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou:
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR abs/2407.17051 (2024) - [i58]Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vickery, Anders Yeo:
Speeding up deferred acceptance. CoRR abs/2409.06865 (2024) - [i57]Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou:
Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree. CoRR abs/2409.07680 (2024) - 2023
- [j188]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. 332: 155-169 (2023) - [j187]Gregory Z. Gutin, Anders Yeo:
(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. 340: 259-271 (2023) - [j186]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the small quasi-kernel conjecture. Discret. Math. 346(7): 113435 (2023) - [j185]David V. Akman, Milad Malekipirbazari, Zeren D. Yenice, Anders Yeo, Niranjan Adhikari, Yong Kai Wong, Babak Abbasi, Alev Taskin Gumus:
k-best feature selection and ranking via stochastic approximation. Expert Syst. Appl. 213(Part): 118864 (2023) - [j184]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Unique stable matchings. Games Econ. Behav. 141: 529-547 (2023) - [j183]Yuefang Sun, Anders Yeo:
Directed Steiner tree packing and directed tree connectivity. J. Graph Theory 102(1): 86-106 (2023) - [j182]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102(3): 578-606 (2023) - [j181]Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo:
Making a tournament k $k$-strong. J. Graph Theory 103(1): 5-11 (2023) - [j180]Gregory Z. Gutin, Anders Yeo:
Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. 37(2): 1142-1161 (2023) - [j179]Michael A. Henning, Christian Löwenstein, Anders Yeo:
The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. 37(2): 1275-1310 (2023) - [j178]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940(Part): 222-230 (2023) - [j177]Jørgen Bang-Jensen, Anders Yeo:
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. 949: 113758 (2023) - [c27]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI 2023: 2642-2650 - [i56]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. CoRR abs/2304.10202 (2023) - [i55]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR abs/2305.07124 (2023) - [i54]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR abs/2307.01109 (2023) - [i53]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Some coordination problems are harder than others. CoRR abs/2311.03195 (2023) - 2022
- [j176]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - [j175]Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo:
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. 38(6): 187 (2022) - [j174]Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo:
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99(4): 615-636 (2022) - [j173]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100(2): 294-314 (2022) - [j172]Gregory Z. Gutin, Anders Yeo:
Perfect forests in graphs and their extensions. J. Graph Theory 101(3): 572-592 (2022) - [j171]Michael A. Henning, Anders Yeo:
A complete description of convex sets associated with matchings and edge-connectivity in graphs. J. Graph Theory 101(4): 643-667 (2022) - [i52]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the Small Quasi-Kernel Conjecture. CoRR abs/2207.12157 (2022) - [i51]Gregory Z. Gutin, Anders Yeo:
(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR abs/2210.07722 (2022) - 2021
- [j170]Michael A. Henning, Anders Yeo:
A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. 302: 1-7 (2021) - [j169]Michael A. Henning, Anders Yeo:
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. Discret. Appl. Math. 304: 12-22 (2021) - [j168]Michael A. Henning, Anders Yeo:
Matching and edge-connectivity in graphs with given maximum degree. Discret. Math. 344(8): 112438 (2021) - [j167]William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo:
Dominating vertex covers: the vertex-edge domination problem. Discuss. Math. Graph Theory 41(1): 123-132 (2021) - [j166]Michael A. Henning, Anders Yeo:
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. Graphs Comb. 37(3): 867-890 (2021) - [j165]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37(6): 2601-2620 (2021) - [j164]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Proper-walk connection number of graphs. J. Graph Theory 96(1): 137-159 (2021) - [c26]Gregory Z. Gutin, Anders Yeo:
Perfect Forests in Graphs and Their Extensions. MFCS 2021: 54:1-54:13 - [i50]Gregory Z. Gutin, Anders Yeo:
Lower Bounds for Maximum Weighted Cut. CoRR abs/2104.05536 (2021) - [i49]Gregory Z. Gutin, Anders Yeo:
Perfect Forests in Graphs and Their Extensions. CoRR abs/2105.00254 (2021) - [i48]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference Swaps for the Stable Matching Problem. CoRR abs/2112.15361 (2021) - 2020
- [j163]Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo:
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. 343(12): 112129 (2020) - [j162]Michael A. Henning, Anders Yeo:
Bounds on upper transversals in hypergraphs. J. Comb. Optim. 39(1): 77-89 (2020) - [j161]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95(2): 267-289 (2020) - [j160]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814: 69-73 (2020) - [j159]Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo:
On the parameterized complexity of 2-partitions. Theor. Comput. Sci. 844: 97-105 (2020) - [c25]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON 2020: 360-371 - [c24]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. IPEC 2020: 2:1-2:16 - [i47]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Exact capacitated domination: on the computational complexity of uniqueness. CoRR abs/2003.07106 (2020) - [i46]Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo:
On the parameterized complexity of 2-partitions. CoRR abs/2003.07190 (2020) - [i45]Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo:
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR abs/2007.02834 (2020) - [i44]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. CoRR abs/2007.06896 (2020)
2010 – 2019
- 2019
- [j158]Michael A. Henning, Anders Yeo:
Upper transversals in hypergraphs. Eur. J. Comb. 78: 1-12 (2019) - [j157]Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang:
Strong subgraph k-connectivity. J. Graph Theory 92(1): 5-18 (2019) - [j156]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92(2): 130-151 (2019) - [i43]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR abs/1903.12225 (2019) - [i42]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR abs/1905.11019 (2019) - [i41]Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Connecting edge-colouring. CoRR abs/1907.00428 (2019) - [i40]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. CoRR abs/1907.00817 (2019) - [i39]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo:
Safe sets in digraphs. CoRR abs/1908.06664 (2019) - 2018
- [j155]Michael A. Henning, Anders Yeo:
On Upper Transversals in 3-Uniform Hypergraphs. Electron. J. Comb. 25(4): 4 (2018) - [j154]Michael A. Henning, Anders Yeo:
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs. Discret. Math. 341(8): 2285-2292 (2018) - [j153]Michael A. Henning, Anders Yeo:
Tight lower bounds on the matching number in a graph with given maximum degree. J. Graph Theory 89(2): 115-149 (2018) - [j152]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719: 64-72 (2018) - [p2]Anders Yeo:
Semicomplete Multipartite Digraphs. Classes of Directed Graphs 2018: 297-340 - [i38]Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang:
Strong Subgraph k-connectivity. CoRR abs/1803.00284 (2018) - 2017
- [j151]Supratim Ghosh, Justin Ruths, Anders Yeo:
Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems. Autom. 86: 166-173 (2017) - [j150]Michael A. Henning, Anders Yeo:
Transversals and Independence in Linear Hypergraphs with Maximum Degree Two. Electron. J. Comb. 24(2): 2 (2017) - [j149]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217: 196-202 (2017) - [j148]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in edge-colored graphs. Discret. Math. 340(2): 1-8 (2017) - [j147]Michael A. Henning, Anders Yeo:
A note on fractional disjoint transversals in hypergraphs. Discret. Math. 340(10): 2349-2354 (2017) - [j146]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83(1): 121-131 (2017) - [j145]Gregory Z. Gutin, Anders Yeo:
Note on Perfect Forests in Digraphs. J. Graph Theory 85(2): 372-377 (2017) - [p1]Gregory Z. Gutin, Anders Yeo:
Parameterized Constraint Satisfaction Problems: a Survey. The Constraint Satisfaction Problem 2017: 179-203 - [i37]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. CoRR abs/1707.09349 (2017) - [i36]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR abs/1707.09400 (2017) - 2016
- [j144]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica 74(1): 367-384 (2016) - [j143]Michael A. Henning, Anders Yeo:
Transversals in 4-Uniform Hypergraphs. Electron. J. Comb. 23(3): 3 (2016) - [j142]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209: 16-26 (2016) - [j141]Alex Eustis, Michael A. Henning, Anders Yeo:
Independence in 5-uniform hypergraphs. Discret. Math. 339(2): 1004-1027 (2016) - [j140]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116(6): 433-436 (2016) - [r1]Anders Yeo:
Kernelization, MaxLin Above Average. Encyclopedia of Algorithms 2016: 1024-1028 - [i35]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in Edge-Colored Graphs. CoRR abs/1601.01824 (2016) - 2015
- [j139]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. J. Comb. Optim. 30(3): 579-595 (2015) - [j138]Michael A. Henning, Anders Yeo:
On 2-Colorings of Hypergraphs. J. Graph Theory 80(2): 112-135 (2015) - [j137]Michael A. Henning, Anders Yeo:
Total Transversals in Hypergraphs and Their Applications. SIAM J. Discret. Math. 29(1): 309-320 (2015) - [j136]Jørgen Bang-Jensen, Anders Yeo:
Balanced branchings in digraphs. Theor. Comput. Sci. 595: 107-119 (2015) - [i34]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR abs/1510.03564 (2015) - [i33]Gregory Z. Gutin, Anders Yeo:
Note on Perfect Forests in Digraphs. CoRR abs/1511.01661 (2015) - [i32]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR abs/1512.06283 (2015) - 2014
- [j135]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68(3): 739-757 (2014) - [j134]Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo:
A New Lower Bound on the Independence Number of a Graph and Applications. Electron. J. Comb. 21(1): 1 (2014) - [j133]Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo:
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21(2): 2 (2014) - [j132]Michael A. Henning, Anders Yeo:
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture. Discret. Appl. Math. 173: 45-52 (2014) - [j131]Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo:
Relating the annihilation number and the 2-domination number of a tree. Discret. Math. 319: 15-23 (2014) - [j130]Janusz Adamus, Lech Adamus, Anders Yeo:
On the Meyniel condition for hamiltonicity in bipartite digraphs. Discret. Math. Theor. Comput. Sci. 16(1): 293-302 (2014) - [j129]Michael A. Henning, Anders Yeo:
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. Graphs Comb. 30(4): 909-932 (2014) - [j128]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo:
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80(4): 687-696 (2014) - [j127]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Diameter 2. J. Graph Theory 75(1): 91-103 (2014) - [j126]Jørgen Bang-Jensen, Anders Yeo:
The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. 520: 87-96 (2014) - 2013
- [j125]Michael A. Henning, Anders Yeo:
Total domination and matching numbers in graphs with all vertices in triangles. Discret. Math. 313(2): 174-181 (2013) - [j124]Michael A. Henning, Anders Yeo:
Hypergraphs with large transversal number. Discret. Math. 313(8): 959-966 (2013) - [j123]Michael A. Henning, Anders Yeo:
Transversals and matchings in 3-uniform hypergraphs. Eur. J. Comb. 34(2): 217-228 (2013) - [j122]Michael A. Henning, Anders Yeo:
22-colorings in kk-regular kk-uniform hypergraphs. Eur. J. Comb. 34(7): 1192-1202 (2013) - [j121]Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo:
A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. 231: 117-124 (2013) - [j120]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
(Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. 113(4): 123-126 (2013) - [j119]Michael A. Henning, Anders Yeo:
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. J. Graph Theory 72(2): 220-245 (2013) - [j118]Robert Crowston, Gregory Z. 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) - [j117]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - [j116]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) - [j115]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
Parameterized complexity of k-Chinese Postman Problem. Theor. Comput. Sci. 513: 124-128 (2013) - [j114]Jason Crampton, Gregory Z. Gutin, Anders Yeo:
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. 16(1): 4 (2013) - [i31]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
Parameterized Complexity of k-Chinese Postman Problem. CoRR abs/1308.0482 (2013) - [i30]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR abs/1308.2599 (2013) - 2012
- [j113]Robert Crowston, Gregory Z. 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) - [j112]Gregory Z. 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) - [j111]Michael A. Henning, Anders Yeo:
Identifying Vertex Covers in Graphs. Electron. J. Comb. 19(4): 32 (2012) - [j110]Gregory Z. Gutin, Anders Yeo:
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discret. Appl. Math. 160(15): 2323-2328 (2012) - [j109]Teresa W. Haynes, Michael A. Henning, Anders Yeo:
On a conjecture of Murty and Simon on diameter two critical graphs II. Discret. Math. 312(2): 315-323 (2012) - [j108]Michael A. Henning, Anders Yeo:
Girth and Total Domination in Graphs. Graphs Comb. 28(2): 199-214 (2012) - [j107]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112(6): 249-251 (2012) - [j106]Gregory Z. 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) - [j105]Gregory Z. 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) - [j104]Michael A. Henning, Anders Yeo:
Vertex Disjoint Cycles of Different Length in Digraphs. SIAM J. Discret. Math. 26(2): 687-694 (2012) - [j103]Jørgen Bang-Jensen, Anders Yeo:
Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. 438: 48-54 (2012) - [c23]Gregory Z. 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 Z. Gutin, Anders Yeo:
On the parameterized complexity of the workflow satisfiability problem. CCS 2012: 857-868 - [c21]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295 - [c20]Robert Crowston, Gregory Z. 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 Z. Gutin, Gabriele Muciaccia, Anders Yeo:
(Non-)existence of Polynomial Kernels for the Test Cover Problem. CoRR abs/1204.4368 (2012) - [i28]Jason Crampton, Gregory Z. Gutin, Anders Yeo:
On the Parameterized Complexity of the Workflow Satisfiability Problem. CoRR abs/1205.0852 (2012) - [i27]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012) - [i26]Robert Crowston, Gregory Z. 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 Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012) - 2011
- [j102]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j101]Michael A. Henning, Ingo Schiermeyer, Anders Yeo:
A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. 18(1) (2011) - [j100]Teresa W. Haynes, Michael A. Henning, Anders Yeo:
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. Discret. Optim. 8(3): 495-501 (2011) - [j99]Arezou Soleimanfallah, Anders Yeo:
A kernel of order 2k-c for Vertex Cover. Discret. Math. 311(10-11): 892-895 (2011) - [j98]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. Discret. Math. 311(13): 1142-1149 (2011) - [j97]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. Discret. Math. 311(17): 1918-1924 (2011) - [j96]Michael A. Henning, Anders Yeo:
Perfect Matchings in Total Domination Critical Graphs. Graphs Comb. 27(5): 685-701 (2011) - [j95]Gregory Z. 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) - [j94]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011) - [j93]Gregory Z. 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 Z. 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 Z. 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 Z. 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 Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. CoRR abs/1104.2818 (2011) - [i22]Gregory Z. Gutin, Anders Yeo:
Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width. CoRR abs/1106.1049 (2011) - [i21]Gregory Z. 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 Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. CoRR abs/1106.4454 (2011) - [i19]Gregory Z. Gutin, Anders Yeo:
Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey. CoRR abs/1108.4803 (2011) - [i18]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$. CoRR abs/1110.5915 (2011) - 2010
- [j92]Gregory Z. Gutin, Anders Yeo:
Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21): 966-969 (2010) - [j91]Jean Daligault, Gregory Z. 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) - [j90]Nathann Cohen, Fedor V. Fomin, Gregory Z. 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) - [j89]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) - [j88]Michael A. Henning, Anders Yeo:
Strong Transversals in Hypergraphs and Double Total Domination in Graphs. SIAM J. Discret. Math. 24(4): 1336-1355 (2010) - [c17]Gregory Z. 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 Z. 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 Z. 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 Z. 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 Z. 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 Z. 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 Z. Gutin, Anders Yeo:
Note on Maximal Bisection above Tight Lower Bound. CoRR abs/1005.2848 (2010) - [i14]Gregory Z. 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)
2000 – 2009
- 2009
- [j87]Katalin M. Hangos, Zsolt Tuza, Anders Yeo:
Some complexity problems on single input double output controllers. Discret. Appl. Math. 157(5): 1146-1158 (2009) - [j86]Gregory Z. Gutin, Anders Yeo:
On the number of connected convex subgraphs of a connected acyclic digraph. Discret. Appl. Math. 157(7): 1660-1662 (2009) - [j85]Allan Frendrup, Preben D. Vestergaard, Anders Yeo:
Total Domination in Partitioned Graphs. Graphs Comb. 25(2): 181-196 (2009) - [j84]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs Comb. 25(4): 521-531 (2009) - [j83]Paul N. Balister, Stefanie Gerke, Gregory Z. 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) - [j82]Michael A. Henning, Anders Yeo:
Total domination in 2-connected graphs and in graphs with no induced 6-cycles. J. Graph Theory 60(1): 55-79 (2009) - [c13]Nathann Cohen, Fedor V. Fomin, Gregory Z. 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 Z. 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 Z. 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 Z. 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 Z. 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 Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) - [i9]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009) - 2008
- [j81]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) - [j80]Gregory Z. Gutin, Anders Yeo:
Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008) - [j79]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost homomorphisms to semicomplete multipartite digraphs. Discret. Appl. Math. 156(12): 2429-2435 (2008) - [j78]Jørgen Bang-Jensen, Anders Yeo:
The minimum spanning strong subdigraph problem is fixed parameter tractable. Discret. Appl. Math. 156(15): 2924-2929 (2008) - [j77]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo:
On matching and total domination in graphs. Discret. Math. 308(11): 2313-2318 (2008) - [j76]Frédéric Havet, Stéphan Thomassé, Anders Yeo:
Hoàng-Reed conjecture holds for tournaments. Discret. Math. 308(15): 3412-3415 (2008) - [j75]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) - [j74]Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Given Girth. Graphs Comb. 24(4): 333-348 (2008) - [j73]Michael A. Henning, Anders Yeo:
Hypergraphs with large transversal number and with edge sizes at least 3. J. Graph Theory 59(4): 326-348 (2008) - [j72]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discret. Math. 22(4): 1624-1639 (2008) - [c8]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234 - [c7]Gregory Z. 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 Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem. CoRR abs/0810.4946 (2008) - 2007
- [j71]Gregory Z. Gutin, Anders Yeo:
The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. 2(1) (2007) - [j70]Stéphan Thomassé, Anders Yeo:
Total domination of graphs and small transversals of hypergraphs. Comb. 27(4): 473-487 (2007) - [j69]Michael A. Henning, Anders Yeo:
A New Upper Bound on the Total Domination Number of a Graph. Electron. J. Comb. 14(1) (2007) - [j68]Pierre Charbit, Stéphan Thomassé, Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16(1): 1-4 (2007) - [j67]Michael A. Henning, Anders Yeo:
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. Graphs Comb. 23(6): 647-657 (2007) - [j66]Anders Yeo:
Paths and cycles containing given arcs, in close to regular multipartite tournaments. J. Comb. Theory B 97(6): 949-963 (2007) - [j65]Anders Yeo:
Relationships between total domination, order, size, and maximum degree of graphs. J. Graph Theory 55(4): 325-337 (2007) - [j64]Gregory Z. 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 Z. 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
- [j63]Gregory Z. Gutin, Angela Koller, Anders Yeo:
Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. 1(1) (2006) - [j62]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
On-line bin Packing with Two Item Sizes. Algorithmic Oper. Res. 1(2) (2006) - [j61]Michael A. Henning, Anders Yeo:
Total Domination and Matching Numbers in Claw-Free Graphs. Electron. J. Comb. 13(1) (2006) - [j60]Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso:
Level of repair analysis and minimum cost homomorphisms of graphs. Discret. Appl. Math. 154(6): 881-889 (2006) - [j59]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost and list homomorphisms to semicomplete digraphs. Discret. Appl. Math. 154(6): 890-897 (2006) - [j58]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Domination analysis for minimum multiprocessor scheduling. Discret. Appl. Math. 154(18): 2613-2619 (2006) - [j57]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. 3(1): 86-94 (2006) - [j56]Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo:
Longest path partitions in generalizations of tournaments. Discret. Math. 306(16): 1830-1839 (2006) - [j55]Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo:
Hamilton cycles in digraphs of unitary matrices. Discret. Math. 306(24): 3315-3320 (2006) - [j54]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
On n-partite Tournaments with Unique n-cycle. Graphs Comb. 22(2): 241-249 (2006) - [c6]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 - [c5]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 - [i6]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006) - [i5]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006) - [i4]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. CoRR abs/cs/0608101 (2006) - 2005
- [j53]Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo:
Mediated digraphs and quantum nonlocality. Discret. Appl. Math. 150(1-3): 41-50 (2005) - [j52]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Batched bin packing. Discret. Optim. 2(1): 71-82 (2005) - [j51]David Blokh, Gregory Z. Gutin, Anders Yeo:
A problem of finding an acceptable variant in generalized project networks. Adv. Decis. Sci. 9(2): 75-81 (2005) - [j50]Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo:
Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) - [j49]Anders Yeo:
The number of pancyclic arcs in a k-strong tournament. J. Graph Theory 50(3): 212-219 (2005) - [c4]Gregory Z. 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 Z. Gutin, Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 - [c2]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103 - [i3]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost and List Homomorphisms to Semicomplete Digraphs. CoRR abs/cs/0507017 (2005) - [i2]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. CoRR abs/cs/0509091 (2005) - [i1]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005) - 2004
- [j48]Jørgen Bang-Jensen, Anders Yeo:
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Comb. 24(3): 331-349 (2004) - [j47]Jørgen Bang-Jensen, Anders Yeo:
Making a tournament k-arc-strong by reversing or deorienting arcs. Discret. Appl. Math. 136(2-3): 161-171 (2004) - [j46]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
When the greedy algorithm fails. Discret. Optim. 1(2): 121-127 (2004) - [j45]Lutz Volkmann, Anders Yeo:
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Discret. Math. 281(1-3): 267-276 (2004) - [j44]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
On the number of quasi-kernels in digraphs. J. Graph Theory 46(1): 48-56 (2004) - [j43]Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. J. Graph Theory 46(4): 265-284 (2004) - 2003
- [j42]Gregory Z. Gutin, Anders Yeo:
Assignment problem based algorithms are impractical for the generalized TSP. Australas. J Comb. 27: 149-154 (2003) - [j41]Gregory Z. Gutin, Alek Vainshtein, Anders Yeo:
Domination analysis of combinatorial optimization problems. Discret. Appl. Math. 129(2-3): 513-520 (2003) - [j40]Gregory Z. Gutin, Anders Yeo:
Upper bounds on ATSP neighborhood size. Discret. Appl. Math. 129(2-3): 533-538 (2003) - [j39]Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo:
Small degree out-branchings. J. Graph Theory 42(4): 297-307 (2003) - [j38]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo:
Packing paths in digraphs. J. Graph Theory 44(2): 81-94 (2003) - [j37]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory 44(3): 193-207 (2003) - [j36]David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich:
Transformations of generalized ATSP into ATSP. Oper. Res. Lett. 31(3): 357-365 (2003) - [j35]Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. SIAM J. Discret. Math. 16(2): 335-343 (2003) - 2002
- [j34]Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discret. Appl. Math. 117(1-3): 81-86 (2002) - [j33]Gregory Z. Gutin, Anders Yeo:
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discret. Appl. Math. 119(1-2): 107-116 (2002) - [j32]Gregory Z. Gutin, Anders Yeo:
Orientations of digraphs almost preserving diameter. Discret. Appl. Math. 121(1-3): 129-138 (2002) - [j31]Jing Huang, Gary MacGillivray, Anders Yeo:
Pushing vertices in digraphs without long induced cycles. Discret. Appl. Math. 121(1-3): 181-192 (2002) - [j30]Meike Tewes, Lutz Volkmann, Anders Yeo:
Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. Discret. Math. 242(1-3): 201-228 (2002) - [j29]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. 18(3): 499-506 (2002) - [j28]Gregory Z. Gutin, Anders Yeo:
Anti-matroids. Oper. Res. Lett. 30(2): 97-99 (2002) - 2001
- [j27]Gregory Z. Gutin, Anders Yeo:
Remarks on hamiltonian digraphs. Australas. J Comb. 23: 115-118 (2001) - [j26]Jørgen Bang-Jensen, Anders Yeo:
Making a tournament k-arc-strong by reversing arcs. Electron. Notes Discret. Math. 8: 2-5 (2001) - [j25]Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. 129(3): 555-568 (2001) - [j24]Gregory Z. 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 Comb. 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 Z. 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. Discret. Math. 212(1-2): 91-100 (2000) - [j20]Jørgen Bang-Jensen, Yubao Guo, Anders Yeo:
Complementary cycles containing prescribed vertices in tournaments. Discret. Math. 214(1-3): 77-87 (2000) - [j19]Gregory Z. Gutin, Meike Tewes, Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discret. Math. 222(1-3): 269-274 (2000) - [j18]Gregory Z. Gutin, Anders Yeo:
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. J. Comb. Theory B 78(2): 232-242 (2000) - [j17]Gregory Z. Gutin, Anders Yeo:
Kings in semicomplete multipartite digraphs. J. Graph Theory 33(3): 177-183 (2000) - [j16]Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Convex-Round and Concave-Round Graphs. SIAM J. Discret. Math. 13(2): 179-193 (2000)
1990 – 1999
- 1999
- [j15]Gregory Z. Gutin, Anders Yeo:
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. 26(4): 321-327 (1999) - [j14]Jørgen Bang-Jensen, Yubao Guo, Anders Yeo:
A New Sufficient Condition for a Digraph to Be Hamiltonian. Discret. Appl. Math. 95(1-3): 61-72 (1999) - [j13]Anders Yeo:
How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? Graphs Comb. 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. J. Graph Theory 32(2): 123-136 (1999) - [j10]Anders Yeo:
Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5. J. Graph Theory 32(2): 137-152 (1999) - [c1]Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Construction Heuristics and Domination Analysis for the Asymmetric TSP. WAE 1999: 85-94 - 1998
- [j9]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discret. Appl. Math. 82(1-3): 247-250 (1998) - [j8]Gregory Z. Gutin, Benny Sudakov, Anders Yeo:
Note on alternating directed cycles. Discret. Math. 191(1-3): 101-107 (1998) - [j7]Jing Huang, Anders Yeo:
Maximal and Minimal Vertex-Critical Graphs of Diameter Two. J. Comb. Theory B 74(2): 311-325 (1998) - [j6]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory 29(2): 111-132 (1998) - 1997
- [j5]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Comb. Probab. Comput. 6(3): 255-261 (1997) - [j4]Anders Yeo:
A Note on Alternating Cycles in Edge-Coloured Graphs. J. Comb. Theory B 69(2): 222-225 (1997) - [j3]Anders Yeo:
One-diregular subgraphs in semicomplete multipartite digraphs. J. Graph Theory 24(2): 175-185 (1997) - 1996
- [j2]Gregory Z. Gutin, Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discret. Appl. Math. 69(1-2): 75-82 (1996) - [j1]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
On k-strong and k-cyclic digraphs. Discret. Math. 162(1-3): 1-11 (1996)
Coauthor Index
[j194] [j182] [j181] [j177] [j176] [j175] [j174] [j173] [j165] [j164] [j163] [j161] [j160] [j159] [c24] [i46] [i45] [i44] [j156] [i43] [i42] [i41] [i40] [i39] [j152] [i37] [i36] [j142] [j136] [j126] [j116] [j103] [j78] [j57] [j56] [c3] [j48] [j47] [j46] [j43] [j39] [j37] [j35] [j26] [j23] [j20] [j16] [j14] [j9] [j6] [j5] [j1]
[j193] [j192] [j191] [j189] [i60] [i59] [i58] [i57] [j188] [j187] [j186] [j184] [j180] [j178] [c27] [i56] [i55] [i54] [i53] [j176] [j172] [i52] [i51] [c26] [i50] [i49] [i48] [j161] [c25] [c24] [i47] [i44] [j157] [i43] [i38] [j149] [j148] [j146] [j145] [p1] [j144] [j140] [i35] [i34] [i33] [i32] [j135] [j128] [j121] [j120] [j118] [j117] [j115] [j114] [i31] [i30] [j113] [j112] [j110] [j107] [j106] [j105] [c23] [c22] [c21] [c20] [i29] [i28] [i27] [i26] [i25] [j102] [j95] [j93] [c19] [c18] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [j92] [j91] [j90] [j89] [c17] [c16] [c15] [c14] [i17] [i16] [i15] [i14] [j86] [j84] [j83] [c13] [c12] [c10] [i12] [i11] [i10] [i9] [j81] [j80] [j79] [j75] [j72] [c8] [c7] [i8] [j71] [j64] [i7] [j63] [j62] [j60] [j59] [j58] [j57] [j55] [j54] [c6] [c5] [i6] [i5] [i4] [j53] [j52] [j51] [j50] [c4] [c3] [c2] [i3] [i2] [i1] [j46] [j44] [j42] [j41] [j40] [j37] [j36] [j34] [j33] [j32] [j29] [j28] [j27] [j25] [j24] [j22] [j19] [j18] [j17] [j15] [c1] [j9] [j8] [j6] [j5] [j2] [j1]
[j195] [j190] [j179] [j171] [j170] [j169] [j168] [j166] [j162] [j158] [j155] [j154] [j153] [j150] [j147] [j143] [j141] [j139] [j138] [j137] [j134] [j133] [j132] [j131] [j129] [j127] [j125] [j124] [j123] [j122] [j119] [j111] [j109] [j108] [j104] [j101] [j100] [j98] [j97] [j96] [j88] [j82] [j77] [j74] [j73] [j69] [j67] [j61]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
