Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
馃搳 Algorithms
Data Structures, Complexity, Graph Theory, Optimization
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
187423
posts in
24.9
ms
Approximating
the Network Design Problem for Potential-Based
Flows
聽
馃
AI
arxiv.org
路
23h
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected
Steiner
Subgraph
聽
馃敩
Computer science research
arxiv.org
路
1d
QAOA
Parameter Transfer for
Hypergraphs
聽
馃
AI
arxiv.org
路
23h
Polynomial-time
recognition and maximum independent set in
Burling
graphs
聽
馃敩
Computer science research
arxiv.org
路
2d
STAR-Filter: Efficient
Convex
Free-Space Approximation via
Starshaped
Set Filtering in Noisy Environments
聽
馃
AI
arxiv.org
路
23h
Clustering
Permutations
under the
Ulam
Metric: A Parameterized Complexity Study
聽
馃
AI
arxiv.org
路
1d
COPUS
: Co-adaptive
Parallelism
and Batch Size Selection in Large Language Model Training
聽
馃
AI
arxiv.org
路
23h
Computational Complexity of the
Interval
Ordering
Problem
聽
馃
AI
arxiv.org
路
2d
MCI
: A Maximal
Clique
Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
聽
馃
AI
arxiv.org
路
3d
Large-scale semi-supervised learning with online
spectral
graph
sparsification
聽
馃
Machine Learning
arxiv.org
路
23h
Improved Hardness Results for Learning
Intersections
of
Halfspaces
聽
馃
Machine Learning
arxiv.org
路
2d
Parsimonious
computational inference protocol for Boolean networks: Application to
osteogenesis
聽
馃
AI
arxiv.org
路
23h
Expander
Hierarchies
for Normalized Cuts on Graphs
聽
馃
AI
arxiv.org
路
3d
On the Average-Case Performance of
Greedy
for
Maximum
Coverage
聽
馃
AI
arxiv.org
路
1d
On the Hardness of Finding
Temporally
Connected
Subgraphs
of Any Size
聽
馃
AI
arxiv.org
路
2d
Cuts and
Gauges
for
Submodular
Width
聽
馃
AI
arxiv.org
路
3d
On the
complexity
of edge
subdivision
to $H$-free graphs
聽
馃
AI
arxiv.org
路
2d
Maximum
Weight Independent Set in
Hereditary
Classes of Ordered Graphs
聽
馃
AI
arxiv.org
路
2d
Moser-Tardos
Algorithm with small number of random bits
聽
馃
AI
arxiv.org
路
3d
Two Efficient
Message-passing
Exclusive
Scan
Algorithms
聽
馃
AI
arxiv.org
路
1d
Sign up or log in to see more results
Sign Up
Login
« Page 2
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help