History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 78 total

Good edge-labelling of graphs. (English)
Discrete Appl. Math. 160, No. 18, 2502-2513 (2012).
1
Approximating minimum power edge-multi-covers. (English)
Hirsch, Edward A. (ed.) et al., Computer science ‒ theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 64-75 (2012).
2
A note on Zagreb indices inequality for trees and unicyclic graphs. (English)
Ars Math. Contemp. 5, No. 1, 73-76 (2012).
3
Linear and 2-frugal choosability of graphs of small maximum average degree. (English)
Graphs Comb. 27, No. 6, 831-849 (2011).
4
The $α$-arboricity of complete uniform hypergraphs. (English)
SIAM J. Discrete Math. 25, No. 2, 600-610 (2011).
5
Acyclic edge-coloring of planar graphs. (English)
SIAM J. Discrete Math. 25, No. 2, 463-478 (2011).
6
A $(1 + \ln 2)$-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 147-157 (2011).
7
Observing degradation of visual representations over short intervals when medial temporal lobe is damaged (English)
J. Cognitive Neuroscience 23, No. 12, 3862-3873 (2011).
8
Cardiorespiratory fitness and the flexible modulation of cognitive control in preadolescent children (English)
J. Cognitive Neuroscience 23, No. 6, 1332-1345 (2011).
9
Evaluation framework for carotid bifurcation lumen segmentation and stenosis grading (English)
Medical Image Analysis 15, No. 4, 477-488 (2011).
10
Linear and 2-frugal choosability of graphs of small maximum average degree (English)
Graphs and Combinatorics 27, No. 6, 831-849 (2011).
11
A (1 + ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (English)
APPROX-RANDOM, 147-157 (2011).
12
On Wiener index of graphs and their line graphs. (English)
MATCH Commun. Math. Comput. Chem. 64, No. 3, 683-698 (2010).
13
Time and space in neuronal networks: the effects of spatial organization on network behavior. (English)
Complexity 16, No. 2, 45-50 (2010).
14
Planar graphs with maximum degree $Δ\geq 9$ are $(Δ+1)$-edge-choosable‒a short proof. (English)
Discrete Math. 310, No. 21, 3049-3051 (2010).
15
Algorithm for finding $k$-vertex out-trees and its application to $k$-internal out-branching problem. (English)
J. Comput. Syst. Sci. 76, No. 7, 650-662 (2010).
16
Preferential duplication graphs. (English)
J. Appl. Probab. 47, No. 2, 572-585 (2010).
17
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. (English)
Boldi, Paolo (ed.), Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2‒4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13121-9/pbk). Lecture Notes in Computer Science 6099, 121-132 (2010).
18
Tradeoffs in process strategy games with application in the WDM reconfiguration problem (English)
FUN, 121-132 (2010).
19
A neurologically plausible artificial neural network computational architecture of episodic memory and recall (English)
BICA, 175-180 (2010).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 78 total