The following pages link to Bin Liu (Q266019):
Displaying 50 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- (Q326980) (redirect page) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- (Q476646) (redirect page) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- (Q497375) (redirect page) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- The information transmission in community networks (Q1673135) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- Circular coloring of planar digraphs (Q1928289) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints (Q2151370) (← links)
- An order approach for the core maintenance problem on edge-weighted graphs (Q2151388) (← links)
- Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
- The short-selling hypothesis of weekend effect and T + 1 trading mechanism (Q2166094) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- The influence of human heterogeneity to information spreading (Q2250976) (← links)
- Profit maximization problem with coupons in social networks (Q2282999) (← links)
- A random algorithm for profit maximization in online social networks (Q2283001) (← links)
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint (Q2300078) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Maximizing profit of multiple adoptions in social networks with a martingale approach (Q2424792) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- On the linear arboricity of graphs embeddable in surfaces (Q2448856) (← links)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- Order based algorithms for the core maintenance problem on edge-weighted graphs (Q2680857) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- (Q2860818) (← links)
- (Q2895418) (← links)
- Acyclic edge chromatic number of outerplanar graphs (Q3055902) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
- (Q3166455) (← links)
- Core Decomposition, Maintenance and Applications (Q3297830) (← links)
- On the adjacent vertex distinguishing edge colourings of graphs (Q3568414) (← links)
- A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games (Q5024477) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
