Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,430,340 papers from all fields of science
Search
Sign In
Create Free Account
Algorithmica
Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
43 relations
ACM Transactions on Algorithms
Algorithms
Anna Karlin
Apex graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The Mondshein Sequence
Jens M. Schmidt
International Colloquium on Automata, Languages…
2013
Corpus ID: 10933022
Canonical orderings [STOC’88, FOCS’92] have been used as a key tool in graph drawing, graph encoding and visibility…
Expand
2013
2013
External Memory Generalized Suffix and LCP Arrays Construction
F. A. Louza
,
G. P. Telles
,
C. D. Ciferri
Annual Symposium on Combinatorial Pattern…
2013
Corpus ID: 42140990
A suffix array is a data structure that, together with the LCP array, allows solving many string processing problems in a very…
Expand
2008
2008
Elementary approximation algorithms for prize collecting Steiner tree problems
Shai Gutner
Information Processing Letters
2008
Corpus ID: 15671332
2008
2008
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks
Donghyun Kim
,
Xianyue Li
,
Feng Zou
,
Zhao Zhang
,
Weili Wu
Wireless Algorithms, Systems, and Applications
2008
Corpus ID: 17523324
Many people studied the Minimum Connected Dominating Set (MCDS) problem to introduce Virtual Backbone (VB) to wireless networks…
Expand
2007
2007
An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration
H. Badis
International Conference on Modeling, Analysis…
2007
Corpus ID: 18053190
In multi-hop wireless networks, flows that traverse the same geographical vicinity contend for the same wireless channel capacity…
Expand
2006
2006
Some remarks about leaf roots
D. Rautenbach
Discrete Mathematics
2006
Corpus ID: 35398466
2006
2006
Computing the λ-Seeds of a String
Hui Zhang
,
Qing Guo
,
C. Iliopoulos
2006
Corpus ID: 17433093
We study the λ-seed problem of a string in this paper. Given a string x of length n and an integer λ, the λ-seed problem is to…
Expand
2005
2005
Shortest monotone descent path problem in polyhedral terrain
Sasanka Roy
,
Sandip Das
,
S. Nandy
Computational geometry
2005
Corpus ID: 635700
Highly Cited
1994
Highly Cited
1994
Sensor based planning and nonsmooth analysis
H. Choset
,
J. Burdick
Proceedings of the IEEE International Conference…
1994
Corpus ID: 18761845
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE