Network profile

Hung Le

Reputation

315

315
224
133

2018
2019
2020
2021

Top tag

ds.algorithms

Next privilege

500 Rep.

Access review queues

Badges

1

9

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

9 votes cast

Questions (7)

Votes Activity Newest

5	Book Embedding Duality of Graphs
4	Hadwiger number under matching contraction
4	Addding edges to spanning tree without destroying planarity
3	Lower bound on light spanners in Euclidean space reference
3	minimum distance r-dominating set on tree

View more →

Reputation (315)

+30	Lower bound on light spanners in Euclidean space reference
+40	Hadwiger number under matching contraction
+10	Amortized analysis of red-black trees
+10	Book Embedding Duality of Graphs

View more →

Answers (2)

Votes Activity Newest

1	Amortized analysis of red-black trees
1	Algorithms from the Book.

Tags (19)

1 ds.algorithms × 2	0 planar-graphs × 2
1 binary-trees	0 topological-graph-theory × 2
0 co.combinatorics × 2	0 topology
0 computational-geometry × 2	0 tree
0 graph-theory × 2	0 soft-question

View more →

Bookmarks (4)

Votes Activity Newest Views Added

368	Algorithms from the Book.
82	What is the actual time complexity of Gaussian elimination?
10	Which graph problems are $W[1]$-Hard on directed(/weighted) graphs but FPT on undirected(/unweighted) graphs?
1	Example of non-disk bounding planarly nested sequences of cycles

Accounts (4)

	Theoretical Computer Science	315 rep	1 silver badge9 bronze badges
	Mathematics	111 rep	3 bronze badges
	Stack Overflow	101 rep	1 bronze badge
	MathOverflow	101 rep	1 bronze badge

Badges (10)

Recent Class Name

Yearling	Scholar
Teacher	Autobiographer
Curious	Informed
Commentator	Supporter
Editor	Student

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (9)

all time			by type
9	up		3	question
0	down		6	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled