Marcin Fankanowski Nauczycieli portret własny A.DPo raz kolejny podjęta została przeze mnie eksploracja obszaru deklarowanych wyborów aksjologicznych nauczycieli1. Tym razem badaniem objęto grupę naucz

Source URL: www.cen.uni.wroc.pl

Gauge  Media*on  in  NMSSM:     Light  Spar*cles  from  a  Light  Singlet     Marcin  Badziak     Ins*tute  of  Theore*cal  Physics   University  of  Warsaw

Source URL: theory.fnal.gov

• Physics
• Particle physics
• Physics beyond the Standard Model
• Supersymmetry
• Next-to-Minimal Supersymmetric Standard Model
• Theoretical physics
• Large ElectronPositron Collider
• Large Hadron Collider
• Minimal Supersymmetric Standard Model

Remote GStreamer Debugger Marcin Kolny October 8, 2015

Source URL: gstreamer.freedesktop.org

• Software
• Computer programming
• GStreamer
• Debuggers
• Debugging
• Pipeline
• Goods and Services Tax Bill

The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+

Source URL: orion.math.iastate.edu

• Graph theory
• Graph operations
• Claw-free graph
• Matching
• Interval graph
• Line graph
• Triangle-free graph
• Indifference graph
• Perfect graph

Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

Source URL: community.dur.ac.uk

• Graph theory
• Planar graphs
• Graph operations
• Graph minor
• Dual graph
• Graph
• Apex graph
• Tree
• Vertex
• Skew partition
• Line graph
• Pathwidth

Marcin Fankanowski1 Krystyna Chmieleńska2 Aleksandra Chybicka1 Andrzej Krajna1 Anetta Pereświet-Sołtan1 Krystyna Sujak-Lesz1

Source URL: www.cen.uni.wroc.pl

Marcin Korolec Minister of the Environment WawelskaPLWarszawa Poland

Source URL: conbio.org

• National parks of Poland
• Society for Conservation Biology
• Biaowiea Forest
• Old-growth forest
• Biaowiea
• Conservation biology
• Biodiversity
• European Congress of Conservation Biology

On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

Source URL: rutcor.rutgers.edu

• NP-complete problems
• Graph theory
• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Maximal independent set
• Independent set
• Matching
• Bipartite graph
• Degree
• Graph
• Line graph

Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles

Source URL: rutcor.rutgers.edu

• Clique-width
• Graph theory
• Split graph
• Graph coloring
• Journal of Graph Theory
• Discrete mathematics
• Planar graph

The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1

Source URL: rutcor.rutgers.edu

• Graph theory
• NP-complete problems
• Planar graph
• Dominating set
• Vertex
• Degree
• Cycle
• Line graph
• Bidimensionality