|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22091 occurrences of 8614 keywords
|
|
|
Results
Found 30405 publication records. Showing 30405 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
17 | Eugene W. Stark, Rance Cleaveland, Scott A. Smolka |
Probabilistic I/O Automata: Theories of Two Equivalences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings, pp. 343-357, 2006, Springer, 3-540-37376-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
process equivalences, continuous-time Markov chains, equational theories, stochastic process algebras, complete axiomatizations |
17 | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter |
Applying Modular Decomposition to Parameterized Bicluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 1-12, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs |
17 | Oswin Aichholzer, Hannes Krasser |
Abstract order type extension and new results on the rectilinear crossing number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 91-98, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudoline arrangement, rectilinear crossing number, complete graph, order type |
17 | Tadeusz Litak |
Modal Incompleteness Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 76(3), pp. 329-342, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
general frames, Kripke incompleteness, neighbourhood incompleteness, complete incompleteness, modal algebras |
17 | Pei-Chi Wu |
On exponential-time completeness of the circularity problem for attribute grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 26(1), pp. 186-190, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
EXPTIME-complete, circularity problem, Attribute grammars, alternating Turing machines |
17 | Dan Noje, Barnabás Bede |
Vectorial MV-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 7(4), pp. 258-262, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Approximation by polynomials, Completions, MV-algebras, Complete lattices |
17 | Gerard Ligozat |
When Tables Tell It All: Qualitative Spatial and Temporal Reasoning Based on Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COSIT ![In: Spatial Information Theory: Foundations of Geographic Information Science, International Conference, COSIT 2001, Morro Bay, CA, USA, September 19-23, 2001, Proceedings, pp. 60-75, 2001, Springer, 3-540-42613-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
weak representation, complete theory, relation algebra, temporal reasoning, spatial reasoning |
17 | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou |
Locating Information with Uncertainty in Fully Interconnected Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 14th International Conference, DISC 2000, Toledo, Spain, October 4-6, 2000, Proceedings, pp. 283-296, 2000, Springer, 3-540-41143-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Information Retrieval, Search, Uncertainty, Random Walks, Complete Network |
17 | Helmut Thiele |
On Isomorphisms between the Lattice of Tolerance Relations and Lattices of Clusterings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 198-202, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
lattice of tolerance relations, lattices of clusterings, one-to-one correspondences, classical set theory, bijections, complete atomistic boolean algebra, strongly model-compact coverings, cluster analysis, set theory, multivalued logic, equivalence classes, isomorphisms, similarity relations, mathematical foundations, lattice isomorphisms |
17 | Christian Glaßer, Alan L. Selman, Samik Sengupta |
Reductions between Disjoint NP-Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 42-53, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Vladimir V. Rybakov |
Barwise's information frames and modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(3), pp. 261-277, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Jian-min Han, Huiqun Yu, Yu Juan, Ting-ting Cen |
A Complete (alpha, k)-Anonymity Model for Sensitive Values Individuation Preservation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISECS ![In: Proceedings of The International Symposium on Electronic Commerce and Security, ISECS 2008, August 3-5, 2008, Guangzhou, China, pp. 318-323, 2008, IEEE Computer Society, 978-0-7695-3258-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
(a, k)-Anonymity Model, Homogeneity Attack, K-anonymity, l-Diversity |
16 | Xinyu Feng 0001, Zhong Shao, Yu Guo, Yuan Dong |
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VSTTE ![In: Verified Software: Theories, Tools, Experiments, Second International Conference, VSTTE 2008, Toronto, Canada, October 6-9, 2008. Proceedings, pp. 54-69, 2008, Springer, 978-3-540-87872-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Randy Goebel |
Folk Reducibility and AI-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, KI 2008, Kaiserslautern, Germany, September 23-26, 2008. Proceedings, pp. 1, 2008, Springer, 978-3-540-85844-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Petr A. Golovach, Jan Kratochvíl |
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 182-191, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject Computational complexity, graph algorithms |
16 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell |
Complete fairness in secure two-party computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 413-422, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cryptography, fairness, secure computation |
16 | Petr A. Golovach, Jan Kratochvíl |
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 1-11, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, graph algorithms |
16 | Anbang Xu, Xin Jin, YuGang Jiang, Ping Guo 0002 |
Complete Two-Dimensional PCA for Face Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (3) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 481-484, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
Clique Graph Recognition Is NP-Complete. ![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. 269-277, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Redundancy in Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 444-454, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Thomas Ågotnes, Michal Walicki |
Strongly Complete Axiomatizations of "Knowing at Most" in Syntactic Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLIMA ![In: Computational Logic in Multi-Agent Systems, 6th International Workshop, CLIMA VI, London, UK, June 27-29, 2005, Revised Selected and Invited Papers, pp. 57-76, 2005, Springer, 3-540-33996-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | S. J. Gismondi, E. R. Swart |
A model of the coNP-complete non-Hamilton tour decision problem for directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 100(3), pp. 471-483, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Extended formulation, Assignment polytope, coNP, Projection, Hamiltonicity |
16 | Bruno B. Gonçalves, Pedro M. Q. Aguiar |
Complete 3-d models from video: a global approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the 2004 International Conference on Image Processing, ICIP 2004, Singapore, October 24-27, 2004, pp. 2479-2482, 2004, IEEE, 0-7803-8554-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Liana Bozga, Cristian Ene, Yassine Lakhnech |
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 42-57, 2004, Springer, 3-540-21298-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood |
Partitions of Complete Geometric Graphs into Plane Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pp. 71-81, 2004, Springer, 3-540-24528-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Jeanette Auer, Richard Hall |
Investigating ID3-Induced Rules from Low-Dimensional Data Cleaned by Complete Case Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings, pp. 414-424, 2004, Springer, 3-540-24059-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Jeong Han Kim, Van H. Vu |
Small Complete Arcs in Projective Planes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(2), pp. 311-363, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05B25 |
16 | Xiao-Shan Gao, Xiaorong Hou, Jianliang Tang, Hang-Fei Cheng |
Complete Solution Classification for the Perspective-Three-Point Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(8), pp. 930-943, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Perspective-Three-Point problem, solution classification, geometric criteria, Wu-Ritt's zero decomposition method, pose determination, analytical solutions |
16 | Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky |
Minimal Complete Primitives for Secure Multi-party Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, pp. 80-100, 2001, Springer, 3-540-42456-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Carla Denise Castanho, Wei Chen 0003, Koichi Wada 0001, Akihiro Fujiwara |
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 59-63, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari |
Making abstract interpretations complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(2), pp. 361-416, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert Wets |
Comparing Complete and Partial Classification for Identifying Latently Dissatisfied Customers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2000, 11th European Conference on Machine Learning, Barcelona, Catalonia, Spain, May 31 - June 2, 2000, Proceedings, pp. 88-95, 2000, Springer, 3-540-67602-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(6), pp. 806-825, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Lewis Carroll, election systems, majority rule, completeness |
16 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 214-224, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Arend Rensink |
A Complete Theory of Deterministic Event Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings, pp. 160-174, 1995, Springer, 3-540-60218-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
Resource Bounded Randomness and Weakly Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 369-377, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Etienne Grandjean |
Linear Time Algorithms and NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers, pp. 248-273, 1992, Springer, 3-540-56992-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Constantine N. K. Osiakwan, Selim G. Akl |
The maximum weight perfect matching problem for complete weighted graphs is in PC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 880-887, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Tony W. Lai, Derick Wood |
Updating Almost Complete Trees or One Level Makes All the Difference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 188-194, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Gautam Das 0001, Deborah Joseph |
Which Triangulations Approximate the Complete Graph?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optimal Algorithms ![In: Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings, pp. 168-192, 1989, Springer, 3-540-51859-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Jinyu Zhou, Yu Tang, Jigao Yan, Tianjiao Yan, Jun Gu |
Complete convergence and complete moment convergence for maximal weighted sums of arrays of rowwise extended negatively dependent random variables with statistical applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 437, pp. 115486, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Snir Hordan, Tal Amir, Steven J. Gortler, Nadav Dym |
Complete Neural Networks for Complete Euclidean Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 12482-12490, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Michael A. Bekos, Michael Kaufmann 0001, Maria Eleni Pavlidi, Xenia Rieger |
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.15395, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Shonda Dueck |
Cyclic partitions of complete and almost complete uniform hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 42(3), pp. 747-758, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai |
The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(2), pp. 287, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Yuntian Wang, Bao Qing Hu |
Constructing overlap and grouping functions on complete lattices by means of complete homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 427, pp. 71-95, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Anurag Singh 0003 |
Higher matching complexes of complete graphs and complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(4), pp. 112761, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Tay-Woei Shyu |
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 41(2), pp. 451-468, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Peter Adams 0001, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit |
Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. ICA ![In: Bull. ICA 92, pp. 50-61, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Tareq M. Al-shami |
Complete Hausdorffness and Complete Regularity on Supra Topological Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. ![In: J. Appl. Math. 2021, pp. 1-7, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002 |
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.04176, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Anatolij Dvurecenskij, Omid Zahiri |
Locally σ-complete and locally complete EMV-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(2), pp. 883-894, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002 |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia., pp. 47:1-47:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-201-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Kaidi Xu, Huan Zhang 0001, Shiqi Wang 0002, Yihan Wang, Suman Jana, Xue Lin, Cho-Jui Hsieh |
Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021, 2021, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Radha Madhavi Duggaraju, Lipika Mazumdar |
An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(1), pp. 276-295, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Kaidi Xu, Huan Zhang 0001, Shiqi Wang 0002, Yihan Wang, Suman Jana, Xue Lin, Cho-Jui Hsieh |
Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.13824, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Jun Ge, Fengming Dong |
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 283, pp. 542-554, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Maxence Ferrari |
Study of a Biosonar Based on the Modeling of a Complete Chain of Emission-Propagation-Reception with Validation on Sperm Whales. (Etude de sonar bio-inspiré basée sur la modélisation d'une chaîne complète d'émission-propagation-réception - Validation sur le cachalot). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
15 | Sk Amanathulla, Sankar Sahoo, Madhumangal Pal |
L (3, 1, 1)-labeling numbers of square of paths, complete graphs and complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 36(2), pp. 1917-1925, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia 0002, Zhenchao Lyu |
Domain-complete and LCS-complete Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDT ![In: Proceedings of the 8th International Symposium on Domain Theory and Its Applications, ISDT 2019, Yangzhou, China, June 14-17, 2019, pp. 3-35, 2019, Elsevier. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei |
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 775, pp. 16-25, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | |
Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.11860, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Xihe Li, Ligong Wang 0001, Xiangxiang Liu |
Complete graphs and complete bipartite graphs without rainbow path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(7), pp. 2116-2126, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Matthew Philippe, Raphaël M. Jungers |
A complete characterization of the ordering of path-complete methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2019, Montreal, QC, Canada, April 16-18, 2019., pp. 138-146, 2019, ACM, 978-1-4503-6282-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | |
Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, pp. 153-167, 2019, Springer, 978-3-030-25026-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Éric Balandraud, Fabio Tardella, Maurice Queyranne |
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 38(1), pp. 29-41, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden |
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 68, pp. 120-131, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Salama Nagy Daoud |
Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 139, pp. 85-103, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz |
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(11), pp. 3134-3140, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Simon Thomas 0001 |
Complete groups are complete co-analytic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 57(5-6), pp. 601-606, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Na Zhu |
Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC-FSKD ![In: 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2018, Huangshan, China, July 28-30, 2018, pp. 1397-1399, 2018, IEEE, 978-1-5386-8097-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mikhail N. Rybakov, Dmitry Shkatov |
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 12, proceedings of the 12th conference on `Advances in Modal Logic,` held in Bern, Switzerland, August 27-31, 2018, pp. 531-539, 2018, College Publications, 978-1-84890-255-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Dmitrij P. Skvortsov |
Remark on the Superintuitionistic Predicate Logic of Kripke Frames of Finite Height with Constant Domains: A Simpler Kripke Complete Logic That Is Not Strongly Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 12, proceedings of the 12th conference on `Advances in Modal Logic,` held in Bern, Switzerland, August 27-31, 2018, pp. 577-590, 2018, College Publications, 978-1-84890-255-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Jean-Emmanuel Bibault |
Prédiction par Deep Learning de la réponse complète après radiochimiothérapie pré-opératoire du cancer du rectum localement avancé. (Deep learning to predict pathologic complete response to neoadjuvant chemoradiation in locally-advanced rectal cancer). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2018 |
RDF |
|
15 | Zhe Chen 0011 |
Parametric runtime verification is NP-complete and coNP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 123, pp. 14-20, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Jesús Medina 0001 |
Notes on "solution sets of inf- αT fuzzy relational equations on complete Brouwerian lattices" and "fuzzy relational equations on complete Brouwerian lattices". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 402, pp. 82-90, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | |
The Complete Extensions do not form a Complete Semilattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.05341, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | S. S. Rukmani, V. Vijayalakshmi 0002 |
Multiplicity of Stars in Complete Graphs and Complete r-partite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 130, pp. 197-204, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Kazutoshi Ando, Ryosuke Inagaki, Kazuya Shoji |
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 225, pp. 1-10, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Jan Konecny 0001, Michal Krupka |
Complete relations on fuzzy complete lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 320, pp. 64-80, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Wenjing Li, Xueliang Li 0001, Jingshu Zhang |
The k-proper index of complete bipartite and complete multipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 68, pp. 304-316, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young |
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 84(4), pp. 552-565, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Luay Yassin Taha, Esam Abdel-Raheem |
A null space approach for complete and over-complete blind source separation of autoregressive source signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCECE ![In: 30th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2017, Windsor, ON, Canada, April 30 - May 3, 2017, pp. 1-4, 2017, IEEE, 978-1-5090-5538-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Carl Johan Casselgren, Roland Häggkvist |
Coloring Complete and Complete Bipartite Graphs from Random Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(2), pp. 533-542, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Gülnaz Boruzanli Ekinci, Alpay Kirlangiç |
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(7), pp. 1950-1953, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Akihiro Uejima, Hiroaki Suzuki |
Fillmat is NP-Complete and ASP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 23(3), pp. 310-316, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Tay-Woei Shyu |
Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(5), pp. 1715-1725, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Jan Konecny 0001, Michal Krupka |
Complete relations on fuzzy complete lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1506.03930, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Gek Ling Chia, Chan L. Lee |
Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 121, pp. 437-446, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Edita Mácajová, Edita Rollová |
Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 78(2), pp. 108-130, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Shuchi Chawla 0001, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev |
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pp. 219-228, 2015, ACM, 978-1-4503-3536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Yoshimi Egawa, Michitaka Furuya |
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 30(5), pp. 1149-1162, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Shuchi Chawla 0001, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev |
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.0681, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Zhidan Yan, Wei Wang 0052 |
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 162, pp. 328-333, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | John Lenz, Dhruv Mubayi |
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 77(1), pp. 19-38, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Kostas Angelopoulos, George-Othon Glentis, Andreas Jakobsson |
Computationally efficient sparsity-inducing coherence spectrum estimation of complete and non-complete data sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Signal Process. ![In: Signal Process. 93(5), pp. 1221-1234, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda |
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 15(2), pp. 215-222, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Salama Nagy Daoud |
Complexity of Products of Some Complete and Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. ![In: J. Appl. Math. 2013, pp. 673270:1-673270:25, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Mike J. Grannell, Martin Knor |
Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 29(4), pp. 921-932, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Amen Souissi |
Modélisation centrée sur les processus métier pour la génération complète de portails collaboratifs. (Business process-centered modeling for the complete generation of collaborative portals). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
Displaying result #201 - #300 of 30405 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|