Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 140 matches
- 2024
- Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Optimal Binary Differential Privacy via Graphs. IEEE J. Sel. Areas Inf. Theory 5: 162-174 (2024) - Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. 38(1): 504-528 (2024) - Lucas Perotin, Hongyang Sun:
Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models. ACM Trans. Parallel Comput. 11(1): 2:1-2:31 (2024) - Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on outerplanar graphs. CoRR abs/2403.01872 (2024) - 2023
- Lucas Simonne:
Détection de règles différentielles causales dans les graphes de connaissances. (Mining differential causal rules in knowledge graphs). University of Paris-Saclay, France, 2023 - Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Improved square coloring of planar graphs. Discret. Math. 346(4): 113288 (2023) - Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann:
The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory 43(1): 195-210 (2023) - Lucas Reis:
Paley-like graphs over finite fields from vector spaces. Finite Fields Their Appl. 88: 102171 (2023) - Cristian F. Coletti, Lucas Roberto de Lima, Alexander Hinsen, Benedikt Jahnel, Daniel Valesin:
Limiting shape for first-passage percolation models on random geometric graphs. J. Appl. Probab. 60(4): 1367-1385 (2023) - Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa:
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory 102(1): 197-200 (2023) - Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa:
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103(4): 767-779 (2023) - Lucas G. S. Jeub, Giovanni Colavizza, Xiaowen Dong, Marya Bazzi, Mihai Cucuringu:
Local2Global: a distributed approach for scaling representation learning on graphs. Mach. Learn. 112(5): 1663-1692 (2023) - Lucas Prieto, Jeroen den Boef, Paul Groth, Joran Cornelisse:
Parameter Efficient Node Classification on Homophilic Graphs. Trans. Mach. Learn. Res. 2023 (2023) - Lucas Magee, Yusu Wang:
Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs. COCOA (1) 2023: 107-125 - Lucas Potin, Rosa Figueiredo, Vincent Labatut, Christine Largeron:
Pattern Mining for Anomaly Detection in Graphs: Application to Fraud in Public Procurement. ECML/PKDD (6) 2023: 69-87 - Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG 2023: 376-387 - Lucas Picasarri-Arrieta:
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring. CoRR abs/2301.04881 (2023) - Lucas Perotin, Hongyang Sun:
Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models. CoRR abs/2304.14127 (2023) - Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR abs/2306.10784 (2023) - Lucas Potin, Rosa Figueiredo, Vincent Labatut, Christine Largeron:
Pattern Mining for Anomaly Detection in Graphs: Application to Fraud in Public Procurement. CoRR abs/2306.10857 (2023) - Lucas Magee, Yusu Wang:
Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs. CoRR abs/2309.16045 (2023) - Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta:
Dichromatic number of chordal graphs. CoRR abs/2309.17385 (2023) - T. Lucas Makinen, Justin Alsing, Benjamin D. Wandelt:
Fishnets: Information-Optimal, Scalable Aggregation for Sets and Graphs. CoRR abs/2310.03812 (2023) - Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of plane trees in convex geometric graphs. CoRR abs/2310.18518 (2023) - Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Optimal Binary Differential Privacy via Graphs. CoRR abs/2310.20486 (2023) - 2022
- Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94: 95-110 (2022) - Jorge Calero-Sanz, Bartolo Luque, Lucas Lacasa:
Haros graphs: an exotic representation of real numbers. J. Complex Networks 10(5) (2022) - Lucas Colucci, Ervin Györi:
On L(2, 1)-labelings of oriented graphs. Discuss. Math. Graph Theory 42(1): 39-46 (2022) - Brook E. Santangelo, Lucas A. Gillenwater, Nourah M. Salem, Lawrence E. Hunter:
Molecular cartooning with knowledge graphs. Frontiers Bioinform. 2 (2022)
skipping 110 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-03 09:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint