Остановите войну!
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 58 matches
- 2023
- Jaume Martí-Farré, Mercè Mora, María Luz Puertas, José Luis Ruiz:
Elimination properties for minimal dominating sets of graphs. Discuss. Math. Graph Theory 43(1): 137-149 (2023) - Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR abs/2307.02022 (2023) - 2022
- Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. Graphs Comb. 38(5): 133 (2022) - Roman Nedela, Martin Skoviera:
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs. J. Comb. Theory, Ser. B 155: 17-44 (2022) - Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36(2): 911-921 (2022) - Nesrine Abbas:
Red Domination in Perfect Elimination Bipartite Graphs. CoRR abs/2203.10630 (2022) - 2021
- Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG 2021: 80-93 - Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. CoRR abs/2106.04191 (2021) - 2020
- Chuan-Min Lee:
The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. Int. J. Comput. Math. Comput. Syst. Theory 5(3): 134-147 (2020) - Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination Distance to Bounded Degree on Planar Graphs. MFCS 2020: 65:1-65:12 - Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination distance to bounded degree on planar graphs. CoRR abs/2007.02413 (2020) - 2019
- Bo Yuan, Qing Yang:
Digitization of Well-Logging Parameter Graphs Based on Gridlines-Elimination Approach. J. Softw. 14(12): 573-578 (2019) - Fritz Obermeyer, Eli Bingham, Martin Jankowiak, Neeraj Pradhan, Justin T. Chiu, Alexander M. Rush, Noah D. Goodman:
Tensor Variable Elimination for Plated Factor Graphs. ICML 2019: 4871-4880 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes. ISIT 2019: 56-60 - Fritz Obermeyer, Eli Bingham, Martin Jankowiak, Justin T. Chiu, Neeraj Pradhan, Alexander M. Rush, Noah D. Goodman:
Tensor Variable Elimination for Plated Factor Graphs. CoRR abs/1902.03210 (2019) - 2018
- David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto:
On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discret. Appl. Math. 243: 140-153 (2018) - 2016
- Jinhong Jung, Kijung Shin, Lee Sael, U Kang:
Random Walk with Restart on Large Graphs Using Block Elimination. ACM Trans. Database Syst. 41(2): 12:1-12:43 (2016) - Jop Briët, Jeroen Zuiddam:
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. CoRR abs/1608.06113 (2016) - 2015
- Kijung Shin, Jinhong Jung, Lee Sael, U Kang:
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs. SIGMOD Conference 2015: 1571-1585 - 2014
- Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu:
Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC 2014: 341-346 - 2013
- Florian Brandner, Quentin Colombet:
Elimination of parallel copies using code motion on data dependence graphs. Comput. Lang. Syst. Struct. 39(1): 25-47 (2013) - B. S. Panda, Dinabandhu Pradhan:
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26(4): 770-785 (2013) - 2012
- Yuli Ye, Allan Borodin:
Elimination graphs. ACM Trans. Algorithms 8(2): 14:1-14:23 (2012) - Florian Brandner, Quentin Colombet:
Copy elimination on data dependence graphs. SAC 2012: 1916-1918 - 2011
- B. S. Panda, Preeti Goel:
L(2, 1)-labeling of perfect elimination bipartite graphs. Discret. Appl. Math. 159(16): 1878-1888 (2011) - Matthijs Bomhoff:
Recognizing Sparse Perfect Elimination Bipartite Graphs. CSR 2011: 443-455 - 2010
- Koji Nuida:
A characterization of signed graphs with generalized perfect elimination orderings. Discret. Math. 310(4): 819-831 (2010)
skipping 28 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-04-23 16:35 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