Остановите войну!
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 29 matches
- 2023
- Wensheng Sun, Yujun Yang:
Solution to a conjecture on resistance diameter of lexicographic product of paths. Discret. Appl. Math. 337: 139-148 (2023) - Partha Ghosh, Takaaki Goto, Leena Jana Ghosh, Soumya Sen:
Scientific Organization of Blood Donation Camp Through Lexicographic Optimization and Taxicab Path Computation. SERA 2023: 372-376 - 2022
- Sunita Kumawat, Chanchal Dudeja, Pawan Kumar:
Ant Lion Optimized Lexicographic Model for Shortest Path Identification. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 30(6): 1065-1087 (2022) - Yun-Xiang Li, Si-Ao Xu, Hongbo Hua, Xiang-Feng Pan:
On the resistance diameter of the Cartesian and lexicographic product of paths. J. Appl. Math. Comput. 68(3): 1743-1755 (2022) - Siyi Li, Xingyang Li, Mengchu Zhou, Ziyan Zhao, Shixin Liu:
Conflict-Based Search and Improvement Strategies for Solving a New Lexicographic Bi-Objective Multi-Agent Path Finding Problem. SMC 2022: 1862-1867 - 2020
- Rommel M. Barbosa, Mitre Costa Dourado, Leila Roling Scariot da Silva:
Global defensive alliances in the lexicographic product of paths and cycles. Discret. Appl. Math. 283: 168-188 (2020) - Tianlong Ma, Jinling Wang, Mingzu Zhang, Xiaodong Liang:
Path 3-(edge-)connectivity of lexicographic product graphs. Discret. Appl. Math. 282: 152-161 (2020) - Ali Ebrahimnejad, Somayeh Tabatabaei, Francisco J. Santos-Arteaga:
A novel lexicographic optimization method for solving shortest path problems with interval-valued triangular fuzzy arc weights. J. Intell. Fuzzy Syst. 39(1): 1277-1287 (2020) - 2017
- Yaping Mao:
Constructing edge-disjoint Steiner paths in lexicographic product networks. Appl. Math. Comput. 308: 1-10 (2017) - 2016
- Yaping Mao:
Path-connectivity of lexicographic product graphs. Int. J. Comput. Math. 93(1): 27-39 (2016) - Teresa Gomes, Luísa Jorge, Paulo E. Melo, Rita Girão-Silva:
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach. Photonic Netw. Commun. 31(1): 11-22 (2016) - 2015
- Shumin Zhang, Chengfu Ye:
On the path-connectivity of lexicographic product graphs. Ars Comb. 121: 141-158 (2015) - 2014
- Francisco Javier Pulido, Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
Multiobjective shortest path problems with lexicographic goal-based preferences. Eur. J. Oper. Res. 239(1): 89-101 (2014) - 2013
- Naohi Eguchi:
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions. FOPARA 2013: 77-92 - Naohi Eguchi:
Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions. CoRR abs/1308.0247 (2013) - 2009
- Naohi Eguchi:
A lexicographic path order with slow growing derivation bounds. Math. Log. Q. 55(2): 212-224 (2009) - Jeffrey Sarnat, Carsten Schürmann:
Lexicographic Path Induction. TLCA 2009: 279-293 - 2008
- Keith So:
Lexicographic path searches for FPGA routing. University of New South Wales, Sydney, Australia, 2008 - Richard J. Nowakowski, Karen Seyffarth:
Small cycle double covers of products I: Lexicographic product with paths and cycles. J. Graph Theory 57(2): 99-123 (2008) - Keith So:
Enforcing long-path timing closure for FPGA routing with path searches on clamped lexicographic spirals. FPGA 2008: 24-34 - 2006
- Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer:
Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen 2006: 541-554 - Harald Zankl:
SAT Techniques for Lexicographic Path Orders. CoRR abs/cs/0605021 (2006) - 2004
- Yoshihito Toyama:
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. RTA 2004: 40-54 - 2000
- E. A. Cichon, Jean-Yves Marion:
The Light Lexicographic path Ordering. CoRR cs.PL/0010008 (2000) - 1997
- Hubert Comon, Ralf Treinen:
The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theor. Comput. Sci. 176(1-2): 67-87 (1997) - 1995
- Pilar de la Torre, Clyde P. Kruskal:
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. J. Algorithms 19(1): 1-24 (1995) - Andreas Weiermann:
Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. Theor. Comput. Sci. 139(1&2): 355-362 (1995) - 1991
- Iain A. Stewart:
Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. WG 1991: 198-208 - 1986
- Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs:
On the average length of lexicographic paths. Math. Program. 35(3): 362-364 (1986)
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-25 07:40 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