default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Jones 0001
Person information
- affiliation: Delft University of Technology, The Netherlands
- affiliation (PhD 2013): University of London, Royal Holloway, Egham, Surrey, UK
Other persons with the same name
- Mark Jones — disambiguation page
- Mark T. Jones (aka: Mark Jones 0002) — Virginia Tech, Blacksburg, Virginia, USA
- Mark Jones 0003 — Azuca Systems, Canada (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Elise Deen, Leo van Iersel, Remie Janssen
, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A near-linear kernel for bounded-state parsimony distance. J. Comput. Syst. Sci. 140: 103477 (2024)- [j34]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Orienting undirected phylogenetic networks. J. Comput. Syst. Sci. 140: 103480 (2024) - [i54]Niels Holtgrefe, Leo van Iersel, Mark Jones:
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs. CoRR abs/2403.12734 (2024) - [i53]Mark Jones, Jannik Schestag:
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead. CoRR abs/2403.14217 (2024) - [i52]Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller:
Maximizing Network Phylogenetic Diversity. CoRR abs/2405.01091 (2024) - [i51]Jordan Dempsey, Leo van Iersel, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Wild Sheep Chase Through an Orchard. CoRR abs/2408.10769 (2024) - [i50]Katharina T. Huber, Leo van Iersel, Mark Jones, Vincent Moulton, Leonie Veenema-Nipius:
Encoding Semi-Directed Phylogenetic Networks with Quarnets. CoRR abs/2408.12997 (2024) - [i49]Martin Frohn, Niels Holtgrefe, Leo van Iersel, Mark Jones, Steven Kelk:
Reconstructing semi-directed level-1 networks using few quarnets. CoRR abs/2409.06034 (2024) - [i48]Jordan Dempsey, Leo van Iersel, Mark Jones, Norbert Zeh:
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees. CoRR abs/2409.08440 (2024) - 2023
- [c28]Mark Jones, Jannik Schestag:
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. IPEC 2023: 30:1-30:12 - [c27]Leo van Iersel, Mark Jones, Esther Julien, Yukihiro Murakami:
Making a Network Orchard by Adding Leaves. WABI 2023: 7:1-7:20 - [i47]Leo van Iersel, Mark Jones, Esther Julien, Yukihiro Murakami:
Making a Network Orchard by Adding Leaves. CoRR abs/2305.03106 (2023) - 2022
- [j33]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. Algorithmica 84(4): 917-960 (2022) - [j32]Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk:
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. Algorithmica 84(7): 2050-2087 (2022) - [j31]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami:
Level-2 networks from shortest and longest distances. Discret. Appl. Math. 306: 138-165 (2022) - [c26]Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau:
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM 2022: 6:1-6:11 - [c25]Leo van Iersel, Mark Jones, Mathias Weller:
Embedding Phylogenetic Trees in Networks of Low Treewidth. ESA 2022: 69:1-69:14 - [i46]Leo van Iersel, Mark Jones, Mathias Weller:
Embedding phylogenetic trees in networks of low treewidth. CoRR abs/2207.00574 (2022) - [i45]Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yuki Murakami, Norbert Zeh:
A Near-Linear Kernel for Two-Parsimony Distance. CoRR abs/2211.00378 (2022) - 2021
- [j30]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A unifying characterization of tree-based networks and orchard networks using cherry covers. Adv. Appl. Math. 129: 102222 (2021) - [j29]Mark Jones, Steven Kelk, Leen Stougie:
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm. J. Comput. Syst. Sci. 117: 165-181 (2021) - 2020
- [j28]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 14-26 (2020) - [c24]Remie Janssen, Mark Jones, Yukihiro Murakami:
Combining Networks Using Cherry Picking Sequences. AlCoB 2020: 77-92 - [i44]Mark Jones, Steven Kelk, Leen Stougie:
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm. CoRR abs/2004.02298 (2020) - [i43]Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk:
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. CoRR abs/2007.13615 (2020)
2010 – 2019
- 2019
- [j27]Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23(4): 715-743 (2019) - [i42]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Rooting for phylogenetic networks. CoRR abs/1906.07430 (2019) - [i41]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. CoRR abs/1907.08474 (2019) - [i40]Mark Jones, Philippe Gambette, Leo van Iersel, Remie Janssen, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Cutting an alignment with Ockham's razor. CoRR abs/1910.11041 (2019) - [i39]Remie Janssen, Mark Jones, Yukihiro Murakami:
Combining Networks using Cherry Picking Sequences. CoRR abs/1912.03999 (2019) - 2018
- [c23]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems. AlCoB 2018: 37-49 - [i38]Leo van Iersel, Mark Jones, Steven Kelk:
A third strike against perfect phylogeny. CoRR abs/1804.07232 (2018) - [i37]Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth of display graphs: bounds, brambles and applications. CoRR abs/1809.00907 (2018) - 2017
- [j26]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79(1): 211-229 (2017) - [j25]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) - [j24]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in edge-colored graphs. Discret. Math. 340(2): 1-8 (2017) - [j23]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic enforcement of information flow policies without public information via tree partitions. J. Comput. Secur. 25(6): 511-535 (2017) - [j22]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst. Sci. 84: 107-119 (2017) - [j21]Philippe Gambette, Leo van Iersel, Mark Jones, Manuel Lafond, Fabio Pardi, Céline Scornavacca:
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8) (2017) - [j20]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31(2): 1294-1327 (2017) - [c22]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). SPIRE 2017: 129-143 - [i36]Mark Jones, Manuel Lafond, Céline Scornavacca:
Consistency of orthology and paralogy constraints in the presence of gene transfers. CoRR abs/1705.01240 (2017) - [i35]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR abs/1705.05295 (2017) - [i34]Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca:
Exploring the tiers of rooted phylogenetic network space using tail moves. CoRR abs/1708.07656 (2017) - 2016
- [j19]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) - [j18]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) - [j17]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32(1): 3-24 (2016) - [j16]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. 30(4): 2177-2205 (2016) - [j15]Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19(3): 8:1-8:29 (2016) - [r1]Mark Jones:
Kernelization, Max-Cut Above Tight Bounds. Encyclopedia of Algorithms 2016: 1021-1024 - [i33]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in Edge-Colored Graphs. CoRR abs/1601.01824 (2016) - [i32]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions. CoRR abs/1608.08386 (2016) - 2015
- [j14]Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized Above the Edwards-Erdős Bound. Algorithmica 72(3): 734-757 (2015) - [c21]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies Without Public Information. ACNS 2015: 389-408 - [c20]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones:
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies. DBSec 2015: 330-345 - [c19]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA 2015: 668-679 - [c18]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC 2015: 43-54 - [c17]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC 2015: 66-77 - [i31]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones:
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. CoRR abs/1503.01382 (2015) - [i30]David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR abs/1504.02420 (2015) - [i29]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-Independent Constraints. CoRR abs/1504.03561 (2015) - [i28]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) - [i27]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
- [j13]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) - [j12]Gregory Z. Gutin, Mark Jones:
Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114(8): 446-449 (2014) - [j11]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. 51: 555-577 (2014) - [j10]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) - [c16]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the k-Arc Chinese Postman Problem. ESA 2014: 530-541 - [c15]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW 2014: 48-59 - [c14]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG 2014: 250-262 - [i26]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR abs/1402.2137 (2014) - [i25]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the $k$-Arc Chinese Postman Problem. CoRR abs/1403.1512 (2014) - [i24]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR abs/1410.5191 (2014) - [i23]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies without Public Information. CoRR abs/1410.5567 (2014) - [i22]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR abs/1412.3023 (2014) - 2013
- [j9]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) - [j8]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) - [j7]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. 511: 77-84 (2013) - [j6]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum balanced subgraph problem parameterized above lower bound. Theor. Comput. Sci. 513: 53-64 (2013) - [c13]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM 2013: 198-209 - [c12]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum Balanced Subgraph Problem Parameterized above Lower Bound. COCOON 2013: 434-445 - [c11]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682 - [c10]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2013: 43-54 - [i21]David A. Cohen, Jason Crampton, Gregory Z. Gutin, Mark Jones:
Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR abs/1306.3649 (2013) - [i20]Gregory Z. Gutin, Mark Jones:
Parameterized Algorithms for Load Coloring Problem. CoRR abs/1308.1820 (2013) - [i19]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1310.2928 (2013) - 2012
- [j5]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) - [j4]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) - [j3]Gregory Z. Gutin, Mark Jones:
Note on Large Subsets of Binary Vectors with Similar Distances. SIAM J. Discret. Math. 26(3): 1108-1111 (2012) - [c9]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS 2012: 400-411 - [c8]Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized above the Edwards-Erdős Bound. ICALP (1) 2012: 242-253 - [c7]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 - [c6]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295 - [c5]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 - [i18]Gregory Z. Gutin, Mark Jones:
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances. CoRR abs/1202.6260 (2012) - [i17]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound. CoRR abs/1207.3586 (2012) - [i16]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012) - [i15]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR abs/1210.0260 (2012) - [i14]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. CoRR abs/1210.3978 (2012) - [i13]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) - [i12]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012) - [i11]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound. CoRR abs/1212.6848 (2012) - 2011
- [j2]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) - [c4]Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147 - [c3]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 - [i10]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) - [i9]Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. CoRR abs/1104.2818 (2011) - [i8]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. CoRR abs/1106.4454 (2011) - [i7]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat Above Average. CoRR abs/1108.4501 (2011) - [i6]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) - [i5]Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized Above the Edwards-Erdős Bound. CoRR abs/1112.3506 (2011) - 2010
- [j1]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Note on Max Lin-2 above Average. Inf. Process. Lett. 110(11): 451-454 (2010) - [c2]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 - [c1]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized above Average. SWAT 2010: 164-175 - [i4]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized Above Average. CoRR abs/1002.0286 (2010) - [i3]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) - [i2]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
- [i1]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Note on Max Lin-2 above Average. CoRR abs/0911.5384 (2009)
Coauthor Index
[j26] [j25] [j24] [j23] [j22] [j19] [j18] [j17] [j16] [j15] [i33] [i32] [c21] [c20] [c19] [c18] [c17] [i31] [i30] [i29] [i28] [i27] [j13] [j12] [j11] [j10] [c16] [c15] [c14] [i26] [i25] [i24] [i23] [i22] [j9] [j8] [j7] [j6] [c13] [c12] [i21] [i20] [j5] [j4] [j3] [c9] [c7] [c6] [c5] [i18] [i17] [i16] [i14] [i13] [i12] [i11] [j2] [c4] [c3] [i10] [i9] [i8] [i7] [i6] [j1] [c2] [c1] [i4] [i3] [i2] [i1]
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-12-12 21:58 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:
