|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1474 occurrences of 1030 keywords
|
|
|
Results
Found 2882 publication records. Showing 2882 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
63 | Andrei A. Krokhin, Peter Jeavons 0001, Peter Jonsson |
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(5), pp. 591-640, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Allen's algebra, dichotomy theorem, representing graphs by intervals, satisfiability of temporal constraints, tractable cases, complexity, NP-completeness |
57 | Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick |
Generalized hypertree decompositions: NP-hardness and tractable variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(6), pp. 30:1-30:32, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic |
57 | Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick |
Generalized hypertree decompositions: np-hardness and tractable variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 13-22, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hypertree decomposition, tree projection problem, NP-complete, hypergraph, conjunctive query, tractable, acyclic |
57 | David A. Cohen, Peter Jeavons 0001, Richard Gault |
New Tractable Classes From Old. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 8(3), pp. 263-282, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
tractable classes, disjunctive constraints, complexity, constraint satisfaction problems |
53 | Manolis Koubarakis, Spiros Skiadopoulos |
Tractable Query Answering in Indefinite Constraint Databases: Basic Results and Applications to Querying Spatiotemporal Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Spatio-Temporal Database Management ![In: Spatio-Temporal Database Management, International Workshop STDBM'99, Edinburgh, Scotland, September 10-11, 1999, Proceedings, pp. 204-223, 1999, Springer, 3-540-66401-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
50 | Lih-Chung Wang, Yuh-Hua Hu, Feipei Lai, Chun-yen Chou, Bo-Yin Yang |
Tractable Rational Map Signature. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings, pp. 244-257, 2005, Springer, 3-540-24454-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
tractable rational maps, digital signature, finite field, public key, multivariate |
50 | Antoine Joux, Sébastien Kunz-Jacques, Frédéric Muller, Pierre-Michel Ricordel |
Cryptanalysis of the Tractable Rational Map Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings, pp. 258-274, 2005, Springer, 3-540-24454-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Tractable Rational Map Cryptosystem, XL, Gröbner Bases, Isomorphism of Polynomials, Public Key Cryptography, Polynomial Systems |
46 | David A. Cohen, Peter Jeavons 0001, Peter Jonsson, Manolis Koubarakis |
Building tractable disjunctive constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(5), pp. 826-853, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
disjunctive constraints, complexity, NP-completeness, constraint satisfaction problem, relations, independence |
43 | Yorick Wilks, Dan Fass, Cheng-ming Guo, James E. McDonald, Tony Plate, Brian M. Slator |
Providing machine tractable dictionary tools. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Transl. ![In: Mach. Transl. 5(2), pp. 99-154, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
computational lexicography, machine tractable dictionaries, pathfinder networkds, preference semantics, semantic primitives, word-sense disambiguation |
37 | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 167-176, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph matching, Fixed parameter tractable, Parameterized complexity, Color coding, Set packing |
37 | Thomas J. Weigert, Jeffrey J. P. Tsai |
A Computationally Tractable Nonmonotonic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(1), pp. 57-63, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
computationally tractable nonmonotonic logic, nonmonotonic reasoning procedures, proof theoretically, semantic characteristics, Herbrand subset, knowledge representation, logic programming, logic programming, reasoning, nonmonotonic reasoning, incomplete information, formal logic, first-order predicate logic |
37 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 544-556, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms |
37 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 163-174, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width |
37 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 394-405, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms |
33 | Dániel Marx |
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 735-744, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability |
33 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh 0001 |
Distortion Is Fixed Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 463-474, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Andrea Calì, Georg Gottlob, Thomas Lukasiewicz |
A general datalog-based framework for tractable query answering over ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA, pp. 77-86, 2009, ACM, 978-1-60558-553-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
ontologies, semantic web, complexity, constraints, dependencies, datalog, conjunctive queries, query evaluation, tractability, chase |
33 | Marco Falda |
A Method for Characterizing Tractable Subsets of Qualitative Fuzzy Temporal Algebrae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WILF ![In: Fuzzy Logic and Applications, 6th International Workshop, WILF 2005, Crema, Italy, September 15-17, 2005, Revised Selected Papers, pp. 71-80, 2005, Springer, 3-540-32529-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Representation of Vague and Imprecise Knowledge, Fuzzy Sets, Possibility Theory |
33 | David A. Cohen, Peter Jeavons 0001, Richard Gault |
New Tractable Classes from Old. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings, pp. 160-171, 2000, Springer, 3-540-41053-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum |
A Practically Implementable and Tractable Delegation Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 14-17, 2000, pp. 27-42, 2000, IEEE Computer Society, 0-7695-0665-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
access control, knowledge representation, logic programs, Authorization, security policies, trust management, delegation |
33 | Hannes Moser, Venkatesh Raman 0001, Somnath Sikdar |
The Parameterized Complexity of the Unique Coverage Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 621-631, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz |
Towards a theory of natural language interfaces to databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IUI ![In: Proceedings of the 8th International Conference on Intelligent User Interfaces, IUI 2003, Miami, FL, USA, January 12-15, 2003, pp. 327, 2003, ACM, 1-58113-586-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
reliability, database, natural language interface |
30 | Joachim Biskup, David W. Embley |
Mediated Information Gain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 2000 International Database Engineering and Applications Symposium, IDEAS 2000, September 18-20, 2000, Yokohoma, Japan, Proccedings, pp. 360-370, 2000, IEEE Computer Society, 0-7695-0789-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
mediated information gain, human burden, algorithmically tractable subtasks, quality level, mediation task, formal information state, returned answer, internal consistency maintenance, relevant source parts, searching, information systems, implementation, embeddings, querying, completeness, rules, correctness, user interactions, updating, sensor fusion, high-level architecture, iteration, schema, precision, revisions, heterogeneous data sources, instance, query specifications |
30 | Thierry Vidal, Hélène Fargier |
Contingent Durations in Temporal CSPs: From Consistency to Controllabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 4th International Workshop on Temporal Representation and Reasoning, TIME '97, Daytona Beach, Florida, USA, May 10-11, 1997, pp. 78-85, 1997, IEEE Computer Society, 0-8186-7937-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
temporal CSPs, Temporal Constraint Networks, classical network consistency property, Strong, Weak, reasoning issues, tractable subclasses, complexity, controllability, controllability, Dynamic |
27 | Justyna Petke, Peter Jeavons 0001 |
The Order Encoding: From Tractable CSP to Tractable SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 371-372, 2011, Springer, 978-3-642-21580-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | David A. Cohen |
Tractable Decision for a Constraint Language Implies Tractable Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 9(3), pp. 219-229, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
complexity, language, tractability |
27 | Peter Jonsson, Christer Bäckström |
Tractable Plan Existence Does Not Imply Tractable Plan Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 22(3-4), pp. 281-296, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Andrea Calì, Georg Gottlob, Andreas Pieris |
Tractable Query Answering over Conceptual Schemata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER ![In: Conceptual Modeling - ER 2009, 28th International Conference on Conceptual Modeling, Gramado, Brazil, November 9-12, 2009. Proceedings, pp. 175-190, 2009, Springer, 978-3-642-04839-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Frauke Oldewurtel, Colin N. Jones, Manfred Morari |
A tractable approximation of chance constrained stochastic MPC based on affine disturbance feedback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 4731-4736, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | András Z. Salamon, Peter G. Jeavons |
Perfect Constraints Are Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, pp. 524-528, 2008, Springer, 978-3-540-85957-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 280-291, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
27 | Thomas Lukasiewicz |
Tractable Probabilistic Description Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SUM ![In: Scalable Uncertainty Management, First International Conference, SUM 2007, Washington, DC, USA, October 10-12, 2007, Proceedings, pp. 143-156, 2007, Springer, 978-3-540-75407-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Marina Meila, Tommi S. Jaakkola |
Tractable Bayesian learning of tree belief networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 16(1), pp. 77-92, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Tree belief network, Decomposable prior, Matrix tree theorem, Spanning tree, Graphical model, Bayesian |
27 | Berilhes Borges Garcia |
New tractable classes for default reasoning from conditional knowledge bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 45(3-4), pp. 275-291, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS subject classification 68T27 |
27 | Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos |
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings, pp. 133-145, 2005, Springer, 3-540-29244-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 196-210, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Alfonso Bosch, Francisco Guil, Roque Marín |
A Tractable Subclass of Fuzzy Constraint Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2005, 10th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 7-11, 2005, Revised Selected Papers, pp. 269-274, 2005, Springer, 3-540-29002-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Jens Gramm, Till Nierhoff, Till Tantau |
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 174-186, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Martin Grohe, Thomas Schwentick, Luc Segoufin |
When is the evaluation of conjunctive queries tractable? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 657-666, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Eiter, Thomas Lukasiewicz |
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000, Proceedings, pp. 313-328, 2000, Springer, 3-540-41131-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Mathias Broxvall, Peter Jonsson, Jochen Renz |
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings, pp. 114-127, 2000, Springer, 3-540-41053-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
On Tractable Queries and Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 10th International Conference, DEXA '99, Florence, Italy, August 30 - September 3, 1999, Proceedings, pp. 1-15, 1999, Springer, 3-540-66448-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Bernhard Nebel, Hans-Jürgen Bürckert |
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(1), pp. 43-66, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constraint satisfaction, temporal reasoning, qualitative reasoning, interval algebra |
27 | Shing-Chi Cheung, Jeff Kramer |
Tractable Dataflow Analysis for Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(8), pp. 579-593, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
action dependency, history sets, pump control system, arbitrary loops, nondeterministic structures, synchronous communicating systems, distributed systems, software engineering, static analysis, distributed processing, program verification, reachability analysis, labeled transition systems, dataflow analysis, software development tools, distributed software engineering, worst-case complexity |
26 | Andrei A. Bulatov |
A dichotomy theorem for constraint satisfaction problems on a 3-element set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(1), pp. 66-120, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
dichotomy theorem, homomorphism problem, complexity, Constraint satisfaction problem |
26 | David A. Cohen, Martin James Green |
Typed Guarded Decompositions for Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 122-136, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Jörg Flum, Martin Grohe, Mark Weyer |
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 555-567, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Parameterized Complexity of Directed Feedback Set Problems in Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 484-492, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Andrei A. Bulatov |
A Dichotomy Theorem for Constraints on a Three-Element Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 649-658, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Shai Gutner |
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 246-257, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel |
20 | Philippe Rolet, Michèle Sebag, Olivier Teytaud |
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (2) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part II, pp. 302-317, 2009, Springer, 978-3-642-04173-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Refael Hassin, R. Ravi 0001, F. Sibel Salman |
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 275-276, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 16-30, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Kun-Jung Hsu, Jonathan Shi |
A tractable time-cost tradeoff algorithm for project activity management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim ![In: Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, San Diego, California, USA, March 22-27, 2009, 2009, SCS/ACM. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
time-cost trade-off, sensitivity analysis, mathematical programming, critical path, parametric programming |
20 | Yasunori Ishihara, Takuji Morimoto, Shougo Shimizu, Kenji Hashimoto, Toru Fujiwara |
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages - DBPL 2009, 12th International Symposium, Lyon, France, August 24, 2009. Proceedings, pp. 68-83, 2009, Springer, 978-3-642-03792-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Ryan Prescott Adams, Iain Murray 0001, David J. C. MacKay |
Tractable nonparametric Bayesian inference in Poisson processes with Gaussian process intensities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 9-16, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | András Faragó |
A General Tractable Density Concept for Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 689-699, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
graph density, densest subgraph, Graph algorithm |
20 | Venkat Chandrasekaran, Jason K. Johnson, Alan S. Willsky |
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(5), pp. 1916-1930, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler |
ELP: Tractable Rules for OWL 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC ![In: The Semantic Web - ISWC 2008, 7th International Semantic Web Conference, ISWC 2008, Karlsruhe, Germany, October 26-30, 2008. Proceedings, pp. 649-664, 2008, Springer, 978-3-540-88563-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Vineet Kahlon |
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 181-192, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Model Checking, Concurrent Programs, Dataflow Analysis, Parameterized Systems, Pushdown Systems |
20 | Igor Razgon, Barry O'Sullivan |
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 551-562, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Michael Botros Shenouda, Timothy N. Davidson |
Tractable approaches to fair QoS broadcast precoding under channel uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 3125-3128, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Steven Y. Ko, Imranul Hoque, Indranil Gupta |
Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 27th IEEE Symposium on Reliable Distributed Systems (SRDS 2008), Napoli, Italy, October 6-8, 2008, pp. 259-268, 2008, IEEE Computer Society, 978-0-7695-3410-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Magnus Bordewich, Charles Semple |
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(3), pp. 458-466, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rooted phylogenetic tree, reticulate evolution, agreement forest, subtree prune and regraft, hybridization network |
20 | Georg Gottlob, Gianluigi Greco |
Combinatorial auctions with tractable winner determination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGecom Exch. ![In: SIGecom Exch. 7(1), pp. 15-18, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler |
Conjunctive Queries for a Tractable Fragment of OWL 1.1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC/ASWC ![In: The Semantic Web, 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference, ISWC 2007 + ASWC 2007, Busan, Korea, November 11-15, 2007., pp. 310-323, 2007, Springer, 978-3-540-76297-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Oliver C. Schrempf, David Albrecht, Uwe D. Hanebeck |
Tractable probabilistic models for intention recognition based on expert knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29 - November 2, 2007, Sheraton Hotel and Marina, San Diego, California, USA, pp. 1429-1434, 2007, IEEE, 978-1-4244-0912-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Yang Xiang 0004 |
Tractable Optimal Multiagent Collaborative Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAT ![In: Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Silicon Valley, CA, USA, November 2-5, 2007, pp. 257-260, 2007, IEEE Computer Society, 0-7695-3027-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Martin Grohe |
The Structure of Tractable Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 58-72, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Dániel Marx |
Chordal Deletion Is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 37-48, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Peter Damaschke |
Fixed-Parameter Tractable Generalizations of Cluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 344-355, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Nicola Fanizzi, Luigi Iannone, Nicola Di Mauro, Floriana Esposito |
Tractable Feature Generation Through Description Logics with Value and Number Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 629-638, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | K. Subramani 0001 |
Tractable Fragments of Presburger Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(5), pp. 647-668, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Hubie Chen |
Periodic Constraint Satisfaction Problems: Tractable Subclasses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 10(2), pp. 97-113, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
periodic problems, polynomial-time algorithms |
20 | Víctor Dalmau |
Generalized Majority-Minority Operations are Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 438-447, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Kian Ming Adam Chai |
Expectation of f-measures: tractable exact computation and some empirical observations of its properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Salvador, Brazil, August 15-19, 2005, pp. 593-594, 2005, ACM, 1-59593-034-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimisation, thresholding, F-measures |
20 | Patrick Healy, Karol Lynch |
Fixed-Parameter Tractable Algorithms for Testing Upward Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 199-208, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Mohamed S. Hassan 0001, Marwan Krunz, Ibrahim Matta |
Markov-based channel characterization for tractable performance analysis in wireless packet networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 3(3), pp. 821-831, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Vida Dujmovic, Sue Whitesides |
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 15-31, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
FPT, Sided crossing minimization, Layer crossing minimization, Layer drawings, Level drawings, NP-completeness, Graph drawing, Fixed parameter tractability |
20 | Hubie Chen, Víctor Dalmau |
Looking Algebraically at Tractable Quantified Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 71-79, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Cliff B. Jones |
The Early Search for Tractable Ways of Reasoning about Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Ann. Hist. Comput. ![In: IEEE Ann. Hist. Comput. 25(2), pp. 26-49, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Andrei A. Bulatov |
Tractable conservative Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 321-, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Ugo Dal Lago, Angelo Montanari, Gabriele Puppis |
Towards Compact and Tractable Automaten-Based Representations of Time Granularities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 72-85, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Szeider |
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 548-558, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Per Carlsson, Arne Andersson, Fredrik Ygge |
A Tractable Mechanism for Time Dependent Markets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 24-27 June 2003, Newport Beach, CA, USA, pp. 31-34, 2003, IEEE Computer Society, 0-7695-1969-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001 |
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 241-248, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Bharat Adsul, Milind A. Sohoni |
Complete and Tractable Local Linear Time Temporal Logics over Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 926-937, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Concurrency, Temporal Logics, Limits, Mazurkiewicz Traces |
20 | Vida Dujmovic, Sue Whitesides |
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers, pp. 118-129, 2002, Springer, 3-540-00158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | John A. Ellis, Hongbing Fan, Michael R. Fellows |
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 180-189, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
graph, dominating set, fixed parameter algorithm, genus |
20 | Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban |
A Tractable Query Cache by Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings, pp. 140-151, 2002, Springer, 3-540-43941-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Wiebe van der Hoek, Michael J. Wooldridge |
Tractable multiagent planning for epistemic goals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The First International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2002, July 15-19, 2002, Bologna, Italy, Proceedings, pp. 1167-1174, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
epistemic & temporal logic, model checking, planning |
20 | Jens Gramm, Rolf Niedermeier |
Minimum Quartet Inconsistency Is Fixed Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings, pp. 241-256, 2001, Springer, 3-540-42271-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Edgar Altamirano, Gonzalo Escalada-Imaz |
Finding Tractable Formulas in NNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 493-507, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
20 | Franz Baader, Ralf Molitor, Stephan Tobies |
Tractable and Decidable Fragments of Conceptual Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Standards and Practices, 7th International Conference on Conceptual Structures, ICCS '99, Blacksburg, Virginia, USA, July 12-15, 1999, Proceedings, pp. 480-493, 1999, Springer, 3-540-66223-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Ulrike Stege |
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 288-293, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Latha S. Colby, Leonid Libkin |
Tractable Iteration Mechanisms for Bag Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings, pp. 461-475, 1997, Springer, 3-540-62222-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
20 | Marko Samer, Stefan Szeider |
Backdoor Sets of Quantified Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 42(1), pp. 77-97, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Backdoor sets, Variable dependencies, Parameterized complexity, Quantified Boolean formulas |
20 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 |
Clique-width: on the price of generality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 825-834, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Dan Olteanu, Jiewen Huang, Christoph Koch 0001 |
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 640-651, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Miki Hermann, Florian Richoux |
On the Computational Complexity of Monotone Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 286-297, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2882 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|