Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
108 | Christian Meilicke, Johanna Völker, Heiner Stuckenschmidt |
Learning Disjointness for Debugging Mappings between Lightweight Ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EKAW ![In: Knowledge Engineering: Practice and Patterns, 16th International Conference, EKAW 2008, Acitrezza, Italy, September 29 - October 2, 2008. Proceedings, pp. 93-108, 2008, Springer, 978-3-540-87695-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
105 | Susan Hohenberger, Stephen A. Weis |
Honest-Verifier Private Disjointness Testing Without Random Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy Enhancing Technologies ![In: Privacy Enhancing Technologies, 6th International Workshop, PET 2006, Cambridge, UK, June 28-30, 2006, Revised Selected Papers, pp. 277-294, 2006, Springer, 3-540-68790-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
private disjointness testing, private intersection cardinality, subgroup decision assumption, private data mining, anonymous login |
93 | Johanna Völker, Denny Vrandecic, York Sure, Andreas Hotho |
Learning Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESWC ![In: The Semantic Web: Research and Applications, 4th European Semantic Web Conference, ESWC 2007, Innsbruck, Austria, June 3-7, 2007, Proceedings, pp. 175-189, 2007, Springer, 978-3-540-72666-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
91 | Troy Lee, Adi Shraibman |
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 81-91, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multiparty communication complexity, disjointness, lower bounds |
76 | Hartmut Klauck |
A strong direct product theorem for disjointness. ![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. 77-86, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
communication-space tradeoffs, disjointness problem, lower bounds, communication complexity, complexity theory, direct product theorems |
76 | Qingsong Ye, Huaxiong Wang, Josef Pieprzyk, Xian-Mo Zhang |
Efficient Disjointness Tests for Private Datasets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, Proceedings, pp. 155-169, 2008, Springer, 978-3-540-69971-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Private Set Disjointness, Private Matching, Secure Multi-Party Computation |
50 | G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. Proceedings, pp. 21-40, 2009, Springer, 978-3-642-10432-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Privacy preserving Set operations, Multiparty Computation |
50 | Jörn Anemüller |
Maximization of Component Disjointness: A Criterion for Blind Source Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA ![In: Independent Component Analysis and Signal Separation, 7th International Conference, ICA 2007, London, UK, September 9-12, 2007., pp. 325-332, 2007, Springer, 978-3-540-74493-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 391-432, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10 |
50 | Peter Høyer, Ronald de Wolf |
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 299-310, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
42 | Reuven Peleg |
זרות יחסית, זרות חלשה וערבוב חלש (Relative disjointness, weak disjointness and weakly mixing.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1971 |
RDF |
|
36 | Troy Lee, Adi Shraibman |
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(2), pp. 309-336, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
36 | Kuo-Hua Wang, Jia-Hung Chen |
K-disjointness paradigm with application to symmetry detection for incompletely specified functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2005 Conference on Asia South Pacific Design Automation, ASP-DAC 2005, Shanghai, China, January 18-21, 2005, pp. 994-997, 2005, ACM Press, 0-7803-8737-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 52-66, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Xuefei Li, Laurie G. Cuthbert |
Node-disjointness-based multipath routing for mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2004, Venezia, Italy, October 4, 2004, pp. 23-29, 2004, ACM, 1-58113-959-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ad hoc networks, multipath routing, low overhead, node-disjoint |
36 | Rahul Jain 0001, Jaikumar Radhakrishnan, Pranab Sen |
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 220-229, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Amit Chakrabarti, Subhash Khot, Xiaodong Sun |
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 107-117, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | David G. Clarke, Sophia Drossopoulou |
Ownership, encapsulation and the disjointness of type and effect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 2002 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, OOPSLA 2002, Seattle, Washington, USA, November 4-8, 2002., pp. 292-310, 2002, ACM, 1-58113-471-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
aliasing, encapsulation, ownership types, type-and-effects systems |
36 | Hartmut Klauck, Ashwin Nayak 0001, Amnon Ta-Shma, David Zuckerman |
Interaction in quantum communication and the complexity of set disjointness. ![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. 124-133, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Charles Elkan |
A Decision Procedure for Conjunctive Query Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA, pp. 134-139, 1989, ACM Press, 0-89791-308-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
29 | Emanuele Viola, Avi Wigderson |
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 427-437, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Alessandro Artale, Diego Calvanese, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev |
Reasoning over Extended ER Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER ![In: Conceptual Modeling - ER 2007, 26th International Conference on Conceptual Modeling, Auckland, New Zealand, November 5-9, 2007, Proceedings, pp. 277-292, 2007, Springer, 978-3-540-75562-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Jie Bao 0001, Doina Caragea, Vasant G. Honavar |
On the Semantics of Linking and Importing in Modular Ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC ![In: The Semantic Web - ISWC 2006, 5th International Semantic Web Conference, ISWC 2006, Athens, GA, USA, November 5-9, 2006, Proceedings, pp. 72-86, 2006, Springer, 3-540-49029-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Aggelos Kiayias, Antonina Mitrofanova |
Syntax-Driven Private Evaluation of Quantified Membership Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings, pp. 470-485, 2006, 3-540-34703-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Mineo Kaneko |
Minimal Set of Essential Resource Disjoint Pairs for Exploring Feasible 3D Schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS ![In: IEEE Asia Pacific Conference on Circuits and Systems 2006, APCCAS 2006, Singapore, 4-7 December 2006, pp. 335-338, 2006, IEEE, 1-4244-0387-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Paul Beame, Toniann Pitassi, Nathan Segerlind |
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1176-1188, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Andreas Bley |
On the complexity of vertex-disjoint length-restricted path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 131-149, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40 |
29 | Thomas G. Kurtz, Udi Manber |
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings, pp. 356-362, 1985, Springer, 3-540-15650-X. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
26 | Christian Sommer 0001, Elad Verbin, Wei Yu 0007 |
Distance Oracles for Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 703-712, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
distance oracle, lopsided set disjointness, data structures, lower bounds, cell-probe model |
26 | Giuseppe Di Battista, Maurizio Lenzerini |
Deductive Entity-Relationship Modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(3), pp. 439-450, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
deductive entity relationship modelling, IS-A, disjointness relations, mandatory participation, formal basis, computational complexity, semantics, conceptual modeling, deductive databases, first-order logic, inference mechanisms, assertions, classes, entity-relationship modelling, interdependencies, polynomial time complexity, inference algorithm |
26 | Meng Chang Chen, Lawrence McNamee |
On the Data Model and Access Method of Summary Data Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 1(4), pp. 519-529, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
summary data management, trinary tuple, statistical function, metaknowledge, average-income, female engineer, derivability problem, disjointness constraint, SD tree, summary data search, computational complexity, data structures, experience, database management systems, data model, access method, insertion, category, deletion, summary, multidimensional access method |
26 | Andrew Chi-Chih Yao |
Lower Bounds for Algebraic Computation Trees with Integer Inputs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 308-313, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
integer inputs, topological lower bound, algebraic computation tree model, integral-constrained form, element distinctness, set disjointness, integer max gap, Milnor-Thom techniques, lower bounds, upper bounds, convex hull, Betti numbers, algebraic varieties, algebraic computation trees |
21 | János Pach, Gábor Tardos, Géza Tóth 0001 |
Disjointness graphs of short polygonal chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 164, pp. 29-43, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro |
Disjointness graphs of segments in R2 are almost all hamiltonian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 342, pp. 168-173, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Bart Bogaerts 0001, Maxime Jakubowski, Jan Van den Bussche |
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 20(1), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Paolo Maffezioli, Achille C. Varzi |
Intuitionistic Mereology II: Overlap and Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Philos. Log. ![In: J. Philos. Log. 52(4), pp. 1197-1233, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Shachar Lovett, Jiapeng Zhang |
Streaming Lower Bounds and Asymmetric Set-Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Guangxu Yang, Jiapeng Zhang |
Lifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.13517, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Allen Ibiapina, Ana Silva 0001 |
Snapshot disjointness in temporal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.06653, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Shachar Lovett, Jiapeng Zhang |
Streaming Lower Bounds and Asymmetric Set-Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.05658, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Shachar Lovett, Jiapeng Zhang |
Streaming Lower Bounds and Asymmetric Set-Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 871-882, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Allen Ibiapina, Ana Silva 0001 |
Snapshot Disjointness in Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 1:1-1:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Alcides Lopes, Joel Luis Carbonera, Mara Abel |
Disjointness axioms between top-level ontology concepts as a heuristic for word similarity evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 35th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2023, Atlanta, GA, USA, November 6-8, 2023, pp. 538-545, 2023, IEEE, 979-8-3503-4273-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro |
On the connectivity of the disjointness graph of segments of point sets in general position in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 24(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 31(2), pp. 9, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Bart Bogaerts 0001, Maxime Jakubowski, Jan Van den Bussche |
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.03553, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Frédéric Magniez, Ashwin Nayak 0001 |
Quantum Distributed Complexity of Set Disjointness on a Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 14(1), pp. 5:1-5:22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, Gábor Tardos, Géza Tóth 0001 |
Disjointness Graphs of Short Polygonal Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany., pp. 56:1-56:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-227-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Ori Rottenstreich |
Survivability via Path Disjointness for HyperX. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APOCS ![In: 3rd Symposium on Algorithmic Principles of Computer Systems, APOCS 2022, Virtual Conference / Alexandria, Virginia, USA, January 12, 2022, pp. 61-75, 2022, SIAM, 978-1-61197-705-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Giuseppe Rizzo 0001, Claudia d'Amato, Nicola Fanizzi |
An unsupervised approach to disjointness learning based on terminological cluster trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Semantic Web ![In: Semantic Web 12(3), pp. 423-447, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, Gábor Tardos, Géza Tóth 0001 |
Disjointness graphs of segments in the space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 30(4), pp. 498-512, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro |
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 13(6), pp. 1050, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Akshay Kamath, Eric Price 0001, David P. Woodruff |
A Simple Proof of a New Set Disjointness with Applications to Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.11338, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Pavel Chuprikov, Vitalii Demianiuk, Sergey Gorinsky |
PREDICAT: Efficient Packet Classification via Prefix Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: 30th International Conference on Computer Communications and Networks, ICCCN 2021, Athens, Greece, July 19-22, 2021, pp. 1-11, 2021, IEEE, 978-1-6654-1278-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Heba Aamer, Jan Van den Bussche |
Input-Output Disjointness for Forward Expressions in the Logic of Information Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: 24th International Conference on Database Theory, ICDT 2021, March 23-26, 2021, Nicosia, Cyprus., pp. 8:1-8:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-179-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Nachum Dershowitz, Rotem Oshman, Tal Roth |
The communication complexity of multiparty set disjointness under product distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 1194-1207, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Akshay Kamath, Eric Price 0001, David P. Woodruff |
A Simple Proof of a New Set Disjointness with Applications to Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 37:1-37:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, István Tomon |
On the chromatic number of disjointness graphs of curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 144, pp. 167-190, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro |
The Chromatic Number of the Disjointness Graph of the Double Chain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 22(1), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Frédéric Magniez, Ashwin Nayak 0001 |
Quantum Distributed Complexity of Set Disjointness on a Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.11795, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.13712, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Vladimir V. Podolskii, Alexander A. Sherstov |
Inner Product and Set Disjointness: Beyond Logarithmically Many Parties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 12(4), pp. 26:1-26:28, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Rita Girão-Silva, Boro Nedic, Matthias Gunkel, Teresa Gomes |
Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 75(4), pp. 374-391, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Thu Huong Nguyen, Andrea G. B. Tettamanzi |
Grammatical Evolution to Mine OWL Disjointness Axioms Involving Complex Concept Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Tsvi Kopelowitz, Virginia Vassilevska Williams |
Towards Optimal Set-Disjointness and Set-Intersection Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 74:1-74:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Frédéric Magniez, Ashwin Nayak 0001 |
Quantum Distributed Complexity of Set Disjointness on a Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 82:1-82:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Thu Huong Nguyen, Andrea G. B. Tettamanzi |
Using Grammar-Based Genetic Programming for Mining Disjointness Axioms Involving Complex Class Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Ontologies and Concepts in Mind and Machine - 25th International Conference on Conceptual Structures, ICCS 2020, Bolzano, Italy, September 18-20, 2020, Proceedings, pp. 18-32, 2020, Springer, 978-3-030-57854-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 23:1-23:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Thu Huong Nguyen, Andrea G. B. Tettamanzi |
A Multi-Objective Evolutionary Approach to Class Disjointness Axiom Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WI/IAT ![In: IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, WI/IAT 2020, Melbourne, Australia, December 14-17, 2020, pp. 275-282, 2020, IEEE, 978-1-6654-1924-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena |
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.03547, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.00831, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 7:1-7:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, István Tomon |
On the Chromatic Number of Disjointness Graphs of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 54:1-54:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Justine Reynaud, Yannick Toussaint, Amedeo Napoli |
Redescription Mining for Learning Definitions and Disjointness Axioms in Linked Open Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Graph-Based Representation and Reasoning - 24th International Conference on Conceptual Structures, ICCS 2019, Marburg, Germany, July 1-4, 2019, Proceedings, pp. 175-189, 2019, Springer, 978-3-030-23181-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, István Tomon |
Coloring Hasse Diagrams and Disjointness Graphs of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings, pp. 244-250, 2019, Springer, 978-3-030-35801-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Thu Huong Nguyen, Andrea G. B. Tettamanzi |
An Evolutionary Approach to Class Disjointness Axiom Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WI ![In: 2019 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2019, Thessaloniki, Greece, October 14-17, 2019, pp. 68-75, 2019, ACM, 978-1-4503-6934-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Thu Huong Nguyen, Andrea G. B. Tettamanzi |
Learning Class Disjointness Axioms Using Grammatical Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming - 22nd European Conference, EuroGP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24-26, 2019, Proceedings, pp. 278-294, 2019, Springer, 978-3-030-16669-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mert Saglam |
Settling the complexity of the k-disjointness and the k-Hamming distance problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
21 | Akanksha Agrawal 0001, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 32(3), pp. 1619-1643, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr 0001, David R. Wood |
The exact chromatic number of the convex segment disjointness graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.01057, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Torsten Mütze, Bartosz Walczak, Veit Wiechert |
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.09969, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette |
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 47(6), pp. 2277-2314, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Boro Nedic, Matthias Gunkel, Teresa Gomes, Rita Girão-Silva |
SRLG-disjointness and geodiverse routing - a practical network study and operational conclusions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RNDM ![In: 10th International Workshop on Resilient Networks Design and Modeling, RNDM 2018, Longyearbyen, Svalbard, Norway, August 27-29, 2018, pp. 1-8, 2018, IEEE, 978-1-5386-7030-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Atsushi Hiruma, Kohei Yatabe, Yasuhiro Oikawa |
Separating Stereo Audio Mixture Having No Phase Difference by Convex Clustering and Disjointness Map. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWAENC ![In: 16th International Workshop on Acoustic Signal Enhancement, IWAENC 2018, Tokyo, Japan, September 17-20, 2018, pp. 266-270, 2018, IEEE, 978-1-5386-8151-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Mahipal Jadeja, Rahul Muthu, V. Sunitha |
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 63, pp. 237-244, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Vladimir V. Podolskii, Alexander A. Sherstov |
Inner Product and Set Disjointness: Beyond Logarithmically Many Parties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR17, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Vladimir V. Podolskii, Alexander A. Sherstov |
Inner Product and Set Disjointness: Beyond Logarithmically Many Parties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.10661, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Mark Braverman, Rotem Oshman |
A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 144-155, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | János Pach, Gábor Tardos, Géza Tóth 0001 |
Disjointness Graphs of Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia, pp. 59:1-59:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-038-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Hartmut Klauck |
The Complexity of Quantum Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, pp. 15:1-15:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-046-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Giuseppe Rizzo 0001, Claudia d'Amato, Nicola Fanizzi, Floriana Esposito |
Terminological Cluster Trees for Disjointness Axiom Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESWC (1) ![In: The Semantic Web - 14th International Conference, ESWC 2017, Portorož, Slovenia, May 28 - June 1, 2017, Proceedings, Part I, pp. 184-201, 2017, 978-3-319-58067-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | François Scharffe |
Class Disjointness Constraints as Specific Objective Functions in Neural Network Classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SemDeep@IWCS ![In: Proceedings of the 2nd Workshop on Semantic Deep Learning, SemDeep@IWCS 2017, Montpellier, France, September 19, 2017, pp. 16-23, 2017, Association for Computational Linguistics. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Andrei Asinowski, Alon Regev |
Triangulations with Few Ears: Symmetry Classes and Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Integers ![In: Integers 16, pp. A5, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Mika Göös, Thomas Watson 0001 |
Communication Complexity of Set-Disjointness for All Probabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 12(1), pp. 1-23, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Gábor Braun, Sebastian Pokutta |
Common Information and Unique Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 76(3), pp. 597-629, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Alexander A. Sherstov |
The Multiparty Communication Complexity of Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 45(4), pp. 1450-1489, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Akanksha Agrawal 0001, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pp. 26:1-26:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-013-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Albin Ahmeti, Diego Calvanese, Axel Polleres, Vadim Savenkov |
Handling Inconsistencies Due to Class Disjointness in SPARQL Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESWC ![In: The Semantic Web. Latest Advances and New Domains - 13th International Conference, ESWC 2016, Heraklion, Crete, Greece, May 29 - June 2, 2016, Proceedings, pp. 387-404, 2016, Springer, 978-3-319-34128-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Omri Weinstein, David P. Woodruff |
The Simultaneous Communication of Disjointness with Applications to Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|